#include <stdio.h>
#include <stdbool.h>
#define MAX 10
int list[MAX] = {1,8,4,6,0,3,5,2,7,9};
void display(){
int i;
// navigate through all items
for(i = 0; i < MAX; i++){
}
}
void bubbleSort() {
int temp;
int i,j;
bool swapped = false;
// loop through all numbers
for(i = 0; i < MAX-1; i++) {
swapped = false;
// loop through numbers falling ahead
for(j = 0; j < MAX-1-i; j++) {
// check if next number is lesser than current no
// swap the numbers.
// (Bubble up the highest number)
if(list[j] > list[j+1]) {
temp = list[j];
list[j] = list[j+1];
list[j+1] = temp;
swapped = true;
printf(" => swapped [%d, %d]\n",list
[j
],list
[j
+1]); }else {
}
}
// if no number was swapped that means
// array is sorted now, break the loop.
if(!swapped) {
break;
}
printf("Iteration %d#: ",(i
+1)); display();
}
}
main(){
display();
bubbleSort();
display();
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRib29sLmg+CgojZGVmaW5lIE1BWCAxMAoKaW50IGxpc3RbTUFYXSA9IHsxLDgsNCw2LDAsMyw1LDIsNyw5fTsKCnZvaWQgZGlzcGxheSgpewogICBpbnQgaTsKICAgcHJpbnRmKCJbIik7CgkKICAgLy8gbmF2aWdhdGUgdGhyb3VnaCBhbGwgaXRlbXMgCiAgIGZvcihpID0gMDsgaSA8IE1BWDsgaSsrKXsKICAgICAgcHJpbnRmKCIlZCAiLGxpc3RbaV0pOwogICB9CgkKICAgcHJpbnRmKCJdXG4iKTsKfQoKdm9pZCBidWJibGVTb3J0KCkgewogICBpbnQgdGVtcDsKICAgaW50IGksajsKCQogICBib29sIHN3YXBwZWQgPSBmYWxzZTsgICAgICAgCiAgIAogICAvLyBsb29wIHRocm91Z2ggYWxsIG51bWJlcnMgCiAgIGZvcihpID0gMDsgaSA8IE1BWC0xOyBpKyspIHsgCiAgICAgIHN3YXBwZWQgPSBmYWxzZTsKCQkKICAgICAgLy8gbG9vcCB0aHJvdWdoIG51bWJlcnMgZmFsbGluZyBhaGVhZCAKICAgICAgZm9yKGogPSAwOyBqIDwgTUFYLTEtaTsgaisrKSB7CiAgICAgICAKICAgICAgICAgLy8gY2hlY2sgaWYgbmV4dCBudW1iZXIgaXMgbGVzc2VyIHRoYW4gY3VycmVudCBubwogICAgICAgICAvLyAgIHN3YXAgdGhlIG51bWJlcnMuIAogICAgICAgICAvLyAgKEJ1YmJsZSB1cCB0aGUgaGlnaGVzdCBudW1iZXIpIAoJCQkKICAgICAgICAgaWYobGlzdFtqXSA+IGxpc3RbaisxXSkgewogICAgICAgICAgICB0ZW1wID0gbGlzdFtqXTsKICAgICAgICAgICAgbGlzdFtqXSA9IGxpc3RbaisxXTsKICAgICAgICAgICAgbGlzdFtqKzFdID0gdGVtcDsKCiAgICAgICAgICAgIHN3YXBwZWQgPSB0cnVlOwogICAgICAgICAgICBwcmludGYoIiA9PiBzd2FwcGVkIFslZCwgJWRdXG4iLGxpc3Rbal0sbGlzdFtqKzFdKTsKICAgICAgICAgfWVsc2UgewogICAgICAgICAgICBwcmludGYoIiA9PiBub3Qgc3dhcHBlZFxuIik7CiAgICAgICAgIH0KCQkJCiAgICAgIH0KCiAgICAgIC8vIGlmIG5vIG51bWJlciB3YXMgc3dhcHBlZCB0aGF0IG1lYW5zIAogICAgICAvLyAgIGFycmF5IGlzIHNvcnRlZCBub3csIGJyZWFrIHRoZSBsb29wLiAKICAgICAgaWYoIXN3YXBwZWQpIHsKICAgICAgICAgYnJlYWs7CiAgICAgIH0KICAgICAgCiAgICAgIHByaW50ZigiSXRlcmF0aW9uICVkIzogIiwoaSsxKSk7IAogICAgICBkaXNwbGF5KCk7ICAgICAgICAgICAgICAgICAgICAgCiAgIH0KCQp9CgptYWluKCl7CiAgIHByaW50ZigiSW5wdXQgQXJyYXk6ICIpOwogICBkaXNwbGF5KCk7CiAgIHByaW50ZigiXG4iKTsKCQogICBidWJibGVTb3J0KCk7CiAgIHByaW50ZigiXG5PdXRwdXQgQXJyYXk6ICIpOwogICBkaXNwbGF5KCk7Cn0=
Input Array: [1 8 4 6 0 3 5 2 7 9 ]
=> not swapped
=> swapped [4, 8]
=> swapped [6, 8]
=> swapped [0, 8]
=> swapped [3, 8]
=> swapped [5, 8]
=> swapped [2, 8]
=> swapped [7, 8]
=> not swapped
Iteration 1#: [1 4 6 0 3 5 2 7 8 9 ]
=> not swapped
=> not swapped
=> swapped [0, 6]
=> swapped [3, 6]
=> swapped [5, 6]
=> swapped [2, 6]
=> not swapped
=> not swapped
Iteration 2#: [1 4 0 3 5 2 6 7 8 9 ]
=> not swapped
=> swapped [0, 4]
=> swapped [3, 4]
=> not swapped
=> swapped [2, 5]
=> not swapped
=> not swapped
Iteration 3#: [1 0 3 4 2 5 6 7 8 9 ]
=> swapped [0, 1]
=> not swapped
=> not swapped
=> swapped [2, 4]
=> not swapped
=> not swapped
Iteration 4#: [0 1 3 2 4 5 6 7 8 9 ]
=> not swapped
=> not swapped
=> swapped [2, 3]
=> not swapped
=> not swapped
Iteration 5#: [0 1 2 3 4 5 6 7 8 9 ]
=> not swapped
=> not swapped
=> not swapped
=> not swapped
Output Array: [0 1 2 3 4 5 6 7 8 9 ]