Bubble Sort
algorithm or method used to order elements by comparing 2 sequential elements at a time and swapping them if they are not in order. To start: compare 1 and 2, then 2 and 3, then 3 and 4, etc. to the ed of the list. Repeat this process until one pass through the list involves no swaps.