@@ -28,6 +28,8 @@ Give the two subarrays that will be merged by the final step of merge sort on th
{% endcapture %}
{% capture explanation %}
Merge sort is a recursive procedure, so it's not necessary to simulate the entire sorting algorithm! We can just assume that `mergeSort` on the left/right halves will return the sorted version of that half.
Unlike insertion sort, selection sort, and heap sort, the recursive calls to `mergeSort` operate on each subarray rather than the entire array! Notice how an element from the right half will not swap to the left half until the final `merge` step.
{% endcapture %}
{% include question.html question=question explanation=explanation number=1 %}
