Mumbai University > Computer Engineering > Sem 3 > Data Structures

Marks: 7M

Year: May 2016

#include < stdio.h>

int main()

{

int n, array[1000], c, d, t;


 printf("Enter number of elements\n");

 scanf("%d", &n);


 printf("Enter %d integers\n", n);

 for (c = 0; c < n; c++) {

        scanf("%d", &array[c]);

}

for (c = 1 ; c <= n - 1; c++)

{

 d = c;

 while ( d > 0 && array[d] < array[d-1]) 

{

          t = array[d];

        array[d]   = array[d-1];

        array[d-1] = t;

          d--;

    }

}

printf("Sorted list in ascending order:\n");

for (c = 0; c <= n - 1; c++)

{

 printf("%d\n", array[c]);

}

return 0;

}

Output:

Enter number of elements

5

Enter 5 integers

4

3

-1

2

1

Sorted list in ascending order:

-1

1

2

3

4