その２
static void merge(int size, int from[], int to[]){
int i, j, k, iend, jend;
int start = 0;
while (start < USER_SIZE){
i = start;
j = start + size;
k = start;
iend = Math.min(start + size, USER_SIZE);
jend = Math.min(start + 2 * size, USER_SIZE);
while (i < iend && j < jend){
if (from[i] <= from[j]){
to[k] = from[i];
i++;
k++;
}else{
to[k] = from[j];
j++;
k++;
}
}