Bubble sort in data structure by R4R Team

Bubble Sort :


program-

#include < stdio.h>
int main()
{
int array[100], n, c, d, swap;

printf("Enter number of elements\n");
scanf("%d", &n);

printf("Enter %d integersn", \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("After Sorting\n");

for (c = 0; c < n; c++)
printf("%dn", array[c]);

return 0;
}

Enter number of element
7
Enter 7 integers
3 1 5 2 6 7 9
After Sorting
1 2 3 5 6 7 9