public void sort( int[] list, int front, int back)
int mid = (front+back)/2;
if( < blank 1 > ) return;
private void help( int[] stuff, int front, int back)
int[] temp = new int[ dif ];
int beg = front, mid = (front+back)/2;
while( beg<saveMid && mid<back ) {
if(stuff[ beg ] < stuff[ mid ] )
temp[ spot++ ]= stuff[ beg++ ];
temp[ spot++ ]= stuff[ mid++ ];
temp[ spot++ ]= stuff[ beg++ ];
temp[ spot++ ]= stuff[ mid++ ];
for(int i = 0; i < < blank 2 > ; ++i)
sort(list, 0, list.length);