public class MergeSort {
public static void merge(int[] list, int low, int mid, int high) {
System.out.println(low+","+mid+","+high);
int i = low;
int j = mid + 1;
int[] temp = new int[high - low + 1];
int k = 0;
while (i <= mid && j <= high) {
// System.out.println(i+","+j);
if (list[i] <= list[j]) {
temp[k++] = list[i++];
} else {
temp[k++] = list[j++];
}
}
while (i <= mid) {
temp[k++] = list[i++];
}
while (j <= high) {
temp[k++] = list[j++];
}
for (i = low, k = 0; i <= high; i++, k++) {
list[i] = temp[k];
}
}
public static void mergeSort(int[] list, int low, int high) {
int mid = (high + low) / 2;
if (low < high) {
mergeSort(list, low, mid);
mergeSort(list, mid + 1, high);
merge(list, low, mid, high);
}
}
public static void main(String[] args) {
int[] list = { 2, 1, 4, 7, 90, 13, 17, 28, 45, 23, 12, 22};
mergeSort(list, 0, list.length-1);
for (int i = 0; i < list.length; i++) {
System.out.print(list[i] + ",");
}
}
}
歸併排序Java版
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.