快排的多种写法（原理都一样）

/**
* 第一个元素当pivot
* @param num
* @param start
* @param end
* @return
*/
public static int partition(int[] num, int start, int end) {
int index = start;
int pivot = num[start];
for(int i = start+1; i <= end; i++) {
if(num[i] <= pivot) {
swap(num,i,++index);
}
}
swap(num,index,start);
return index;
}
/**
* 最后一个元素当pivot
* @param num
* @param start
* @param end
* @return
*/
public static int partition1(int[] num, int start, int end) {
int index = start- 1;
int pivot = num[end];
for(int i = start; i < end; i++) {
if(num[i] <= pivot) {
swap(num,++index,i);
}
}
swap(num,++index,end);
return index;
}
/**
* 随机选取元素当pivot
* @param num
* @param start
* @param end
* @return
*/
public static int partition2(int[] num,int start, int end) {
int k = (int) (Math.random()*(end - start) + start);
swap(num,start,k);
int index = start;
int pivot = num[start];
for(int i = start+1; i <= end; i++) {
if(num[i] <= pivot) {
swap(num,i,++index);
}
}
swap(num,index,start);
return index;
}
/**
* 左右向中间逼近的过程中互相填坑。
* @param num
* @param start
* @param end
* @return
*/
public static int partition3(int[] num, int start, int end) {
int pivot = num[start];
while(start < end) {
while(start < end && num[end] > pivot) {
end--;
}
num[start] = num[end];
while(start < end && num[start] <= pivot) {
start++;
}
num[end] = num[start];
}
num[start] = pivot;
return start;
}
/**
* 左右逼近的过程中互相交换
* @param num
* @param start
* @param end
* @return
*/
public static int partition4(int[] num, int start, int end) {
int pivot = num[start];
int i = start;
int j = end;
while(true) {
while(i <= end && num[i] <= pivot) {
i++;
}
while(j > start && num[j] >= pivot) {
j--;
}
if(i >= j)
break;
swap(num,i,j);
}
swap(num,start,j);
return j;
}
public static void swap(int[] num, int i, int j) {
int temp = num[i];
num[i] = num[j];
num[j] = temp;
}
public static void quickSort(int[] num,int start, int end) {
if(start < end) {
int k = partition4(num,start,end);
quickSort(num,start,k-1);
quickSort(num,k+1,end);
}
}
}