cs162/labs/lab9/lab9.cpp
/* l is for left index and r is right index of the 
 * *    sub-array of arr to be sorted */
l is for left index and r is right index of the
sub-array of arr to be sorted
l is for left index and r is right index of the sub - array of arr to be sorted
void mergeSort(int *arr, int l, int r) { 
	if (l < r) { 
		int m = l+(r-l)/2; 
		mergeSort(arr, l, m); 
		mergeSort(arr, m+1, r); 
		merge(arr, l, m, r); 
	} 
}
void mergeSort ( int * arr , int l , int r ) { if ( l < r ) { int m = l + ( r - l ) / 2 ; mergeSort ( arr , l , m ) ; mergeSort ( arr , m + 1 , r ) ; merge ( arr , l , m , r ) ; } }
l is for left index and r is right index of the
 *    sub-array of arr to be sorted
l is for left index and r is right index of the * sub - array of arr to be sorted
// Same as (l+r)/2, but avoids overflow for  // large l and h  // Sort first and second halves 