Bubble sort

Sort an array into ascending order in place using bubble sort: walk through the array comparing each pair of neighbours and swapping them if they're in the wrong order. After each full pass the largest remaining value has "bubbled" to the end, so repeat until everything is sorted.

Complete void bubble_sort(int *a, int n) to sort the n elements into ascending order, in place. Repeatedly pass through the array swapping any out-of-order neighbours.

/* Sort a[0..n-1] ascending, in place. Do not write main(). */
void bubble_sort(int *a, int n) {
    /* change this */
}

Click Run to see the output here.

Next lesson →

Bubble sort

Bubble sort

Sign in

Log in or create account