作者:spring709272032 | 来源:互联网 | 2023-08-23 17:17
代码:publicclassMS{publicstaticvoidmain(String[]args){intarray[]{2,63,25,33,24,19,39
代码:`public class MS {
public static void main(String[] args) { int array[] = { 2, 63, 25, 33, 24, 19, 39 };System.out.println("排序前:"+Arrays.toString(array));MargerSort(array, 0, array.length - 1);System.out.println("排序后:"+Arrays.toString(array));}private static void MargerSort(int[] A, int left, int right) { int mid;if (left A[j],不再继续加,所以现在k=j)位k=k+1;j=j+1;}}//另一边的数据while (i <= mid) {a[k] = A[i];k=k+1;i=i+1;}while (j <= right) {a[k] = A[j];k=k+1;j=j+1;}k = 0;while (left <= right) {//已经排好序的赋值回去A[left] = a[k];k=k+1;left=left+1;}}
}
帮助理解