Merge Sort (part-3) The recursive function

The MergeSort function repeatedly divides the array into ,,
two halves until we reach a stage where we try to perform MergeSort on a,,
subarray of size 1 i.e. p == r. After that, the merge function comes into play and ,,
combines the sorted arrays into larger arrays until the whole array is merged.