Hello I havent begun to code merge sorth because I am still trying to understand how the algorithm works. This is what I know from browsing around the net:

"MergeSort is a recursive sorting procedure that uses O(n log n) comparisons in the worst case. To sort an array of n elements, we perform the following three steps in sequence:

If n<2 then the array is already sorted. Stop now.

Otherwise, n>1, and we perform the following three steps in sequence:

Sort the left half of the the array.

Sort the right half of the the array.

Merge the now-sorted left and right halves."

So my question is how do I sort each halve? Do i employ another sorting algorithm to do it? Any clarification is appreciated.