MergeSort dengan Java

import jeliot.io.*;

public class mergeSort{
public static void main(String a[]){
int i;
int array[] = {12,9,4,7,15,1,3,10};
System.out.println("ARIF RAKHMAN HADI");
System.out.println("MOH JA'FAR SHODIQ");
System.out.println("DANAR TRI BASTONI");
System.out.println("ZAENAL");
System.out.println("BENEDICTUS");

System.out.println(" Program Merge Sort");
System.out.println("Nilai Sebelum DiMarge Sort :");
for(i = 0; i < array.length; i++) System.out.print( array[i]+" "); System.out.println(); mergeSort_srt(array,0, array.length-1); System.out.println("Nilai Setelah DiMargeSort :"); for(i = 0; i = high) {
return;
}

int middle = (low + high) / 2;
mergeSort_srt(array, low, middle);
mergeSort_srt(array, middle + 1, high);
int end_low = middle;
int start_high = middle + 1;
while ((lo <= end_low) && (start_high <= high)) { if (array[low] < array[start_high]) { low++; } else { int Temp = array[start_high]; for (int k = start_high- 1; k >= low; k--) {
array[k+1] = array[k];
}
array[low] = Temp;
low++;
end_low++;
start_high++;
}
}
}
}