We introduce the recursive *merge sort* algorithm and compare it to *insertion sort*, which was discussed last lecture. We'll get to review `while`

loops, and recursion as well. We'll continue analyzing the algorithms by counting the number of comparisons that are required. If you will take the next programming course (CS 2110) later, you will learn much more about the algorithms, different implementations, and analysis.

- Compare Insertion and Merge (3 minutes) Which of these two tasks is easier?

**Slides:** individual slides for viewing, 6-up layout for printing

**Examples:**

**Answers ** to the question on slide 17 is here.