Search⌘ K

Challenge: Implement Merge Sort

Implement the merge sort algorithm by recursively sorting subarrays and merging them. Understand how divide-and-conquer helps to efficiently sort arrays in ascending order.

We'll cover the following...

The mergeSort() function should recursively sort the subarray array[pr]array[p \cdots r] ...