/* Bubble sort code */
#include<stdio.h>
#include<stdlib.h>
//bubble sort using function
void bubble_sort(int [], int); //function definition
int main() {
int array[100], n, c, d, swap;
printf("Enter number of elements\n");
printf("Enter %d integers\n", n
);
for (c = 0; c < n; c++)
bubble_sort(array, n);
printf("Sorted list in ascending order:\n");
for (c = 0; c < n; c++)
return 0;
}
void bubble_sort(int list[], int n) //function body
{
int c, d, t;
for (c = 0; c < (n - 1); c++) //outer loop
{
for (d = 0; d < n - c - 1; d++) //inner loop
{
if (list[d] > list[d + 1]) {
/* Swapping */
t = list[d]; //using temporary variable
list[d] = list[d + 1];
list[d + 1] = t;
}
}
}
}
LyogQnViYmxlIHNvcnQgY29kZSAqLwogCiNpbmNsdWRlPHN0ZGlvLmg+CiNpbmNsdWRlPHN0ZGxpYi5oPgogCi8vYnViYmxlIHNvcnQgdXNpbmcgZnVuY3Rpb24KIAp2b2lkIGJ1YmJsZV9zb3J0KGludCBbXSwgaW50KTsgLy9mdW5jdGlvbiBkZWZpbml0aW9uCiAKaW50IG1haW4oKSB7CiAgICBpbnQgYXJyYXlbMTAwXSwgbiwgYywgZCwgc3dhcDsKIAogICAgcHJpbnRmKCJFbnRlciBudW1iZXIgb2YgZWxlbWVudHNcbiIpOwogICAgc2NhbmYoIiVkIiwgJm4pOwogCiAgICBwcmludGYoIkVudGVyICVkIGludGVnZXJzXG4iLCBuKTsKIAogICAgZm9yIChjID0gMDsgYyA8IG47IGMrKykKICAgICAgICBzY2FuZigiJWQiLCAmYXJyYXkpOwogCiAgICBidWJibGVfc29ydChhcnJheSwgbik7CiAKICAgIHByaW50ZigiU29ydGVkIGxpc3QgaW4gYXNjZW5kaW5nIG9yZGVyOlxuIik7CiAKICAgIGZvciAoYyA9IDA7IGMgPCBuOyBjKyspCiAgICAgICAgcHJpbnRmKCIlZFxuIiwgYXJyYXkpOwogCiAgICByZXR1cm4gMDsKfQogCnZvaWQgYnViYmxlX3NvcnQoaW50IGxpc3RbXSwgaW50IG4pIC8vZnVuY3Rpb24gYm9keQp7CiAgICBpbnQgYywgZCwgdDsKIAogICAgZm9yIChjID0gMDsgYyA8IChuIC0gMSk7IGMrKykgLy9vdXRlciBsb29wCiAgICB7CiAgICAgICAgZm9yIChkID0gMDsgZCA8IG4gLSBjIC0gMTsgZCsrKSAvL2lubmVyIGxvb3AKICAgICAgICB7CiAgICAgICAgICAgIGlmIChsaXN0W2RdID4gbGlzdFtkICsgMV0pIHsKICAgICAgICAgICAgICAgIC8qIFN3YXBwaW5nICovCiAKICAgICAgICAgICAgICAgIHQgPSBsaXN0W2RdOyAvL3VzaW5nIHRlbXBvcmFyeSB2YXJpYWJsZQogICAgICAgICAgICAgICAgbGlzdFtkXSA9IGxpc3RbZCArIDFdOwogICAgICAgICAgICAgICAgbGlzdFtkICsgMV0gPSB0OwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgfQp9