Previous Lecture

lect16

Next Lecture

lect16, Mon 03/11

Week 10: Merge Sort

Code from lecture

https://github.com/ucsb-cs24-w24/cs24-w24-lectures/tree/main/lect16

Topics

• Divide and Conquer Algorithms
• Subdivide a larger problem into smaller problems
• Solve each smaller part

• Combine solutions of smaller sub problems back into the larger problem

• Sorting: So far we covered selection sort which runs in O(n^2)
• Today we will learn about Merge Sort, which runs in O(n log n)