归并排序的java实现

public class MergeSort {
public static void merge_sort(int [] arrays,int start,int end){
if(start<end){
int m = (end+start)/2;
merge_sort(arrays,start,m);
merge_sort(arrays,m+1,end);
merge(arrays,start,m,end);
}
}
public static int[] merge(int[] arrays,int start,int m,int end){
int length = end - start + 1;
int i =start;
int j = m+1;
int c = 0;
int[] tempArray = new int[length];
while(i<=m &&j<=end){
if(arrays[i]<=arrays[j]){
tempArray[c] = arrays[i];
c++;
i++;
}else{
tempArray[c] = arrays[j];
c++;
j++;
}
}
//次出代表j<=end条件已经不满足，即m+1到j已经全部插入
while(i<=m){
tempArray[c] = arrays[i];
c++;
i++;
}
while(j<=end){
tempArray[c] = arrays[j];
c++;
j++;
}
//此处注意，tempArray是从0，到length-1
c=0;
for(int t=start;t<=end;t++){
arrays[t] = tempArray[c];
c++;
}
return tempArray;


}
public static void main(String[] args) {
int[] arrays ={23,1,45,7,323,45,234,23,43,24};
merge_sort(arrays,0,arrays.length-1);
for(int i=0;i<=9;i++){
System.out.println(arrays[i]);
}
}


}