Anonymous user
Sorting algorithms/Bubble sort: Difference between revisions
→{{header|C}}: Print array before and after sort
(→{{header|C}}: Print array before and after sort) |
|||
Line 557:
=={{header|C}}==
<lang c>#include <stdio.h>
void bubble_sort (int *a, int n) {
int i, t, s = 1;
Line 572 ⟶ 573:
}
}
int main () {
int a[] = {4, 65, 2, -31, 0, 99, 2, 83, 782, 1};
int n = sizeof a / sizeof a[0];
int i;
for (i = 0; i < n; i++)
printf("%d%s", a[i], i == n - 1 ? "\n" : " ");
bubble_sort(a, n);
for (i = 0; i < n; i++)
printf("%d%s", a[i], i == n - 1 ? "\n" : " ");
return 0;
}
</lang>
{{out}}
<pre>
4 65 2 -31 0 99 2 83 782 1
-31 0 1 2 2 4 65 83 99 782
</pre>
=={{header|C++}}==
| |||