Day 32/merge.cpp
void mergeSort(int array[], int const begin, int const end)
{
    if (begin >= end)
        return; // Returns recursivly

    auto mid = begin + (end - begin) / 2;
    mergeSort(array, begin, mid);
    mergeSort(array, mid + 1, end);
    merge(array, begin, mid, end);
}
// begin is for left index and end is
// right index of the sub-array
// of arr to be sorted */
begin is for left index and end is
right index of the sub-array
of arr to be sorted
begin is for left index and end is right index of the sub - array of arr to be sorted
void mergeSort(int array[], int const begin, int const end)
{
    if (begin >= end)
        return; 
    auto mid = begin + (end - begin) / 2;
    mergeSort(array, begin, mid);
    mergeSort(array, mid + 1, end);
    merge(array, begin, mid, end);
}
void mergeSort ( int array [ ] , int const begin , int const end ) { if ( begin >= end ) return ; auto mid = begin + ( end - begin ) / 2 ; mergeSort ( array , begin , mid ) ; mergeSort ( array , mid + 1 , end ) ; merge ( array , begin , mid , end ) ; }
begin is for left index and end is
right index of the sub-array
of arr to be sorted
begin is for left index and end is right index of the sub - array of arr to be sorted
// Returns recursivly