Tonight I’m looking at some sorting algorithms in Python. First up are Bubble Sort and Selection sort, both with 
average and worst case runtime, and 
memory. Then I’ll look at an iterative and recursive implementation of Merge Sort, Quick Sort, and Heap Sort with 
.