Bubble sort in C to arrange numbers in ascending order; you can modify it for descending order and can also sort strings. The bubble sort algorithm isn't efficient as its both average-case as well as worst-case complexity are O(n2).

#include
int main()
{
int array[100], n, c, d, swap;
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 = 0 ; c < ( n - 1 ); c++)
{
for (d = 0 ; d < n - c - 1; d++)
{
if (array[d] > array[d+1])
{
swap = array[d];
array[d] = array[d+1];
array[d+1] = swap;
}
}
}
printf("Sorted list in ascending order:\n");
for ( c = 0 ; c < n ; c++ )
printf("%d\n", array[c]);
printf("\nSorted list in descending order:\n");
for ( c = n-1 ; c >= 0; c-- )
printf("%d\n", array[c]);
return 0;
}

Output:123

654

789

369

8552

147

Sorted list in Ascending order:

123

147

369

654

789

8552

Sorted list in Descending order:

8552

789

654

369

147

123

need an explanation for this answer? contact us directly to get an explanation for this answer