Bubble sort

The idea behind a bubble sort algorithm is very simple. Given an unordered list, we compare adjacent elements in the list, each time, putting in the right order of magnitude, only two elements. The algorithm hinges on a swap procedure.

Take a list with only two elements:

To sort this list, simply swap them into the right position with 2 occupying index 0 and 5 occupying index 1. To effectively swap these elements, we need to have a temporary storage area:

Implementation of the bubble sort algorithm starts with the swap method, illustrated in the preceding image. First, element 5 will be copied to a temporary location, temp. Then element 2 will be moved to index 0. Finally, 5 will be moved from temp to index 1. At the end of it all, the elements will have been swapped. The list will now contain the element: [2, 5]. The following code will swap the elements of unordered_list[j] with unordered_list[j+1] if they are not in the right order:

    temp = unordered_list[j] 
    unordered_list...