摘要:
public static void quicksort(int[] array,int low,int high) { if(low > high) { return; } int i=low; int j=high; int temp = array[low];//temp就是基准位 while 阅读全文
摘要:
public static void merge(int[] array, int start, int mid, int end) { int[] temp = new int[array.length]; int i=start,j=mid+1,k=start; while(i != mid+1 阅读全文
摘要:
public static void shellsort(int[] array) { int n = array.length; int d = n / 2; while(d > 0) { for(int i = d ;i < n;i++) { int j = i - d; while(j >= 阅读全文