pset3/find/helpers_merge.c
void sort(int values[], int n)
{
    
    int buf[n];
    
    // copy the array in the buffer
    copy(values, buf, n);
    
    // start the recursion
    split_merge(buf, values, 0, n);
    
    return;
}
/**
 * Sorts array of n values.
 */
Sorts array of n values.
Sorts array of n values .
void sort(int values[], int n)
{
    int buf[n];
    copy(values, buf, n);
    split_merge(buf, values, 0, n);
    return;
}
void sort ( int values [ ] , int n ) { int buf [ n ] ; copy ( values , buf , n ) ; split_merge ( buf , values , 0 , n ) ; return ; }
Sorts array of n values.
Sorts array of n values .
// copy the array in the buffer // start the recursion