- 快速排序是一种“分而治之”的思想,每次排序将当前序列最左边的元素设为哨兵,设置两个指针low和high,将两指针所指的元素分别和哨兵进行比较;将high指针指向的比哨兵小的元素,放在low的位置;将low指针指向的比哨兵大的元素放在high的位置。当low和high指向同一位置后,此位置即哨兵位置,将该位置赋予哨兵的值。然后以哨兵为界,将哨兵左侧的“一串”和哨兵右侧的“一串”递归执行上述过程。
- 即,每次排序做了两个工作:a.将比哨兵小的元素置于哨兵的左侧,将比哨兵大的元素置于哨兵的右侧,b.将哨兵放入正确的位置。
public class QuickSort {
public int partition(int[] arr, int low, int high) {
int key = arr[low];
while (low < high) {
while (arr[high] >= key && high > low) {
high--;
}
arr[low] = arr[high];
while (arr[low] <= key && low<high){
low++;
}
arr[high] = arr[low];
}
arr[high] = key;
return high;
}
//输出数组
public void outArr(int[] arr){
for (int i=0;i<arr.length;i++){
System.out.print(arr[i]+" ");
}
System.out.print("\n");
}
public void sort(int[] arr, int low, int high){
if (low>= high){
return ;
}
int index = partition(arr, low ,high);
sort(arr, low ,index-1);
sort(arr, index+1, high);
}
//生成随机数组,对数器;暴力测
public static int[] generateRandomArray() {
int length = (int) (Math.random() * 20) + 5; //长度5-20,每个元素的值为1-20
int[] arr = new int[length];
for (int i = 0; i < arr.length; i++) {
arr[i] = (int) (Math.random() * 20) + 1;
}
return arr;
}
public static void main(String[] args){
QuickSort quickSort = new QuickSort();
int testTime = 5;
for (int i=0;i<testTime;i++){
int arr[] = generateRandomArray();
quickSort.sort(arr,0,arr.length-1);
quickSort.outArr(arr);
}
}
}
python版本
def partitions(arr, low, high):
key = arr[low]
while(low < high):
while(arr[high] >= key and high > low):
high -= 1
arr[low] = arr[high]
while(arr[low] <= key and high > low):
low += 1
arr[high] = arr[low]
arr[high] = key
return high
def sort(arr, low, high):
if (low >= high):
return
index = partitions(arr, low, high)
sort(arr, low, index - 1)
sort(arr, index + 1, high)