In this video, we'll take a look at Merge Sort, a divide-and-conquer algorithm implemented using recursion. It sorts an array in two phases: first, by splitting it into one-element arrays, and then merging them back into sorted order. If you find recursion challenging, this video is designed not only to help you learn Merge Sort but also to aid you in visualizing the recursive process, understanding how methods are called, and how they're pushed into the call stack.
Course content:
00:00 - 00:05 Intro
00:05 - 00:28 Overview of Merge Sort Algorithm
00:28 - 01:08 Splitting Phase
01:08 - 01:31 Merging Phase
01:31 - 03:24 Merge Sort Explained (Splitting Phase)
03:24 - 06:29 Merge Sort Explained (Merging Phase)
06:29 - 09:50 Implementation (Split)
09:50 - 12:18 Visualization of the recursion process
12:18 - 17:47 Implementation (Merge)
17:47 - 18:40 Algorithmic Properties
18:40 - 18:48 Outro