Week 3 recap

This week, you looked at three sorting algorithms — bubble sort, insertion sort, and merge sort — and how to implement them. You also compared the efficiency of these three algorithms, thinking about how long they might have taken to run with different lengths of list.

Next week, you’re going to move on from sorting to another common procedure: searching.