Dain1234 / Design-and-analysis-algorithm

0 stars 0 forks source link

Bubble sort #10

Open Dain1234 opened 2 years ago

Dain1234 commented 2 years ago

Screenshot (53)

Dain1234 commented 2 years ago

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]) / For decreasing order use '<' instead of '>' / { 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]);

return 0; }