Bubble Sort

In this video we are going to use the bubble sort algorithm to sort a list of 5 numbers. The bubble sort algorithm works by taking the value in the first position of the list and comparing it to the value in the second position of the list. If the value in the second position of the list is less than the value in the first position of the list, the values are swapped, with the smaller value taking the lower position. This continues until the value stored in the last position is compared to the value stored in the second to last position of the list. Ultimately, this first pass on the list will set the largest value in the list to the highest position in the list.
If the length of the list is represented by n, after n-1 passes, the list will be completely sorted.
The bubble sort algorithm has a time complexity of O(n^2) in the worse case and O(n) in the best case.