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 ...
