1.1 BUBBLE SORT
The bubble sort is the oldest and simplest sorting method in
use. Unfortunately, it's also the slowest. The bubble sort works
by comparing each item in the list with the item next to it, and
swapping them if required. The algorithm repeats this process
until it makes a pass all the way through the list without
swapping any items (in other words, all items are in the correct
order). This causes larger values to "bubble" to the end of the
list while smaller values "sink" towards the beginning of the
list. The total number of comparisons