W2022 CS 210 Lecture 12 - B (Merge Sort)

This is just an additional supplemental lecture on Merge Sort. For more details on the worst-case analysis, see the notes.

Time Stamps:
0:00 Opening, merge
13:52 Merge Sort
24:01 Example (high-level, I encourage you to walk through the merge process to see how it functions exactly)
32:48 Time complexity, last remarks.