-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuickSort.java
More file actions
63 lines (51 loc) · 1.78 KB
/
QuickSort.java
File metadata and controls
63 lines (51 loc) · 1.78 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package sort;
/**
* Created by bruce_shan on 2018/6/4 14:29.
* Description : 快速排序 以及它的变体
*/
public class QuickSort {
public void quickSort(int[] array, int left, int right) {
if (left >= right) {
return;
}
int middle = partition(array, left, right);
quickSort(array, left, middle - 1);
quickSort(array, middle + 1, right);
}
// 一次划分过程
private int partition(int[] array, int left, int right) {
int middle = left;
int middleKey = array[middle];
while (left < right) {
// 高指针先走
while (left < right && array[right] > middleKey) { // 高指针找到 <= 中轴的数停下
right--;
}
while (left < right && array[left] <= middleKey) { // 低指针找到 > 中轴的数停下
left++;
}
// 交换高低指针的值
if(left <right){
array[left] = array[left] ^ array[right];
array[right] = array[left] ^ array[right];
array[left] = array[left] ^ array[right];
}
}
// 将中轴的值放置到中轴位置
if(right > middle){
array[middle] = array[middle] ^ array[right];
array[right] = array[middle] ^ array[right];
array[middle] = array[middle] ^ array[right];
}
return right;
}
public static void main(String[] args) {
int[] array = {4,5,1,6,2,7,3,8};
// 测试下自己写的快排，不知道这是第几次写了
QuickSort quickSort = new QuickSort();
quickSort.quickSort(array,0,array.length-1);
for(int num : array){
System.out.print(" "+num);
}
}
}