// bubble sort
#include <stdio.h>
#include <stdbool.h>
int main()
{
int n;
//bool flag;
printf("Enter the number of elements : "); scanf("%d", &n);
int arr[n];
printf("Enter the %d elements : ", n
); // input
for (int i = 0; i < n; i++)
{
scanf("%d", &arr[i]);
}
// output before sorting
for (int i = 0; i < n; i++)
{
}
// sorting
for (int i = 0; i < n - 1; i++)
{
flag = false;
for (int j = 0; j < n - 1 - i; j++)
{
if (arr[j] > arr[j + 1])
{
int temp = arr[j + 1];
arr[j + 1] = arr[j];
arr[j] = temp;
// flag = true;
}
}
//if (flag == false)
//{
// break;
//}
}
// after sorting
for (int i = 0; i < n; i++)
{
}
return 0;
}
Ly8gYnViYmxlIHNvcnQKI2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRib29sLmg+CgppbnQgbWFpbigpCnsKICAgIGludCBuOwogICAgLy9ib29sIGZsYWc7CiAgICBwcmludGYoIkVudGVyIHRoZSBudW1iZXIgb2YgZWxlbWVudHMgOiAiKTsKICAgIHNjYW5mKCIlZCIsICZuKTsKICAgIGludCBhcnJbbl07CiAgICBwcmludGYoIkVudGVyIHRoZSAlZCBlbGVtZW50cyA6ICIsIG4pOwogICAgLy8gaW5wdXQKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQogICAgewogICAgICAgIHNjYW5mKCIlZCIsICZhcnJbaV0pOwogICAgfQogICAgLy8gb3V0cHV0IGJlZm9yZSBzb3J0aW5nCiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykKICAgIHsKICAgICAgICBwcmludGYoIiVkXHQiLCBhcnJbaV0pOwogICAgfQogICAgcHJpbnRmKCJcbiIpOwoKICAgIC8vIHNvcnRpbmcKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbiAtIDE7IGkrKykKICAgIHsKICAgICAgICBmbGFnID0gZmFsc2U7CiAgICAgICAgZm9yIChpbnQgaiA9IDA7IGogPCBuIC0gMSAtIGk7IGorKykKICAgICAgICB7CiAgICAgICAgICAgIGlmIChhcnJbal0gPiBhcnJbaiArIDFdKQogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICBpbnQgdGVtcCA9IGFycltqICsgMV07CiAgICAgICAgICAgICAgICBhcnJbaiArIDFdID0gYXJyW2pdOwogICAgICAgICAgICAgICAgYXJyW2pdID0gdGVtcDsKICAgICAgICAgICAgICAgLy8gZmxhZyA9IHRydWU7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICAgICAgLy9pZiAoZmxhZyA9PSBmYWxzZSkKICAgICAgICAvL3sKICAgICAgICAvLyAgICBicmVhazsKICAgICAgICAvL30KICAgIH0KICAgIC8vIGFmdGVyIHNvcnRpbmcKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQogICAgewogICAgICAgIHByaW50ZigiJWRcdCIsIGFycltpXSk7CiAgICB9CgogICAgcmV0dXJuIDA7Cn0=