In today's video, we look at implementing Merge Sort.
Merge sort is a recursive divide and conqueror algorithm that divides a sorting problem into smaller more manageable chunks before combing them into the sorted group. Once all the elements are divided into individual values it rebuilds them up a sorted array.
In the video, we go over the setup, implement the algorithm, and then gather statistics to show our results.
In the next lesson, we will look at Heap Sort, the first of the recursive sorting algorithms.
