def sort(self, toSort): for i in range(len(toSort) - 1): if toSort[i] > toSort[i + 1]: toSort[i], toSort[i + 1] = toSort[i + 1], toSort[i] self.sort(toSort) return toSort

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort. Although the algorithm is simple, most of the other sorting algorithms are more efficient for large lists.

**Q:** Suppose you have the following list of numbers to sort, `[4,1,3,2]` what would the list look like after each pass?

Answer should be submitted as an array of arrays