Find the smallest element greater than ar2 [ i ] . Move all elements one position ahead till the smallest greater element is not found
int j , last = ar1 [ m - 1 ] ; for ( j = m - 2 ; j >= 0 && ar1 [ j ] > ar2 [ i ] ; j -- ) ar1 [ j + 1 ] = ar1 [ j ] ;