merge sort

this is a function that split the array into subsets recursively .. My problem is that I don't understand how the function will recurse twice..Isn't is supposed to recurse first with new arguments(a,i,mid).. how will it then return and take new argum...