16.Java排序测试代码（冒泡、插入、选择、希尔、快速排序）

public class SortTest {

public static void bubbleSort(int[] array){
//后续补充
}

public static void insertSort(int[] array){
//后续补充
}

public static void chooseSort(int[] array){
//后续补充
}

/*希尔排序~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
public static void shellKnuthSort(int[] array){

int gap = 1;
while(gap < array.length/3){
gap = gap*3+1;
}
//        int gap = (array.length-1)/3;
while(gap > 0){
int current;
for (int i = gap; i < array.length; i+=gap) {
current = array[i];
int j = i-1;
while(j>=0 && array[j]>current){
array[j+1] = array[j];
j--;
}
array[j+1] = current;

}
gap = (gap-1)/3;
}

for (int i = 0; i < array.length ; i++) {
System.out.print(array[i] +" => ");
}
}

/*快速排序~~~~~~~~~~~~~~~~~~*/
public static int quickSortProcess(int[] array , int start,int end){
/*选中当前序列的第一个作为基准值*/
int i = start+1;
int j = end;
int standard = array[start];

while(true){
while(i<end && array[i] < standard){
i++;
}

while (j>start && array[j] > standard){
j--;
}
if(j <= i){
break;
}else {
int tmp = array[i];
array[i] = array[j];
array[j] = tmp;
}

}

array[start] = array[j];
array[j] = standard;
return j;
}

public static void quickSort(int[] array, int start,int end){
if(end <=start){
return;
}else {
int divide = quickSortProcess(array,start,end);
quickSort(array,start,divide-1);
quickSort(array,divide+1,end);
}

}

public static void main(String[] args) {
//        shellKnuthSort(new int[]{4,2,8,9,5,7,6,1,3,10});
int[] array = new int[]{4,2,8,9,5,7,6,1,3,10};
quickSort(array,0,9);

for (int i = 0; i < array.length ; i++) {
System.out.print(array[i] +" => ");
}

}
}