原理:
代码和上图没关系:
package com.lyj.sort;
public class MergeSort {
/**
* @param args
*/
public static void main(String[] args) {
int[] array = { 1, 8, 6, 4, 10, 5, 3, 2, 22 };
mergeSort(array, 0, array.length - 1);
}
private static void mergeSort(int[] array, int start, int end) {
if (start < end) {
int mid = (start + end) / 2;
mergeSort(array, start, mid);
mergeSort(array, mid + 1, end......
阅读全文