Merge Sort JavaScript

Merge Sort requires a merging function, which merges two sorted arrays. This isn't very complicated at all. Next we must make the actual merge sort function that relies on recursion. This recursive function breaks down our input array into smaller arrays of 1 length or less. Next we use our merge function to rebuild these arrays into sorted pieces. This part can get a little confusing! Hopefully I offer some clarity in my video!

[mihaelacostea]

But where did you do the sorting of the 2 arrays?