-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuickSort.java
More file actions
52 lines (47 loc) · 1.46 KB
/
QuickSort.java
File metadata and controls
52 lines (47 loc) · 1.46 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
package SortPractice;
import java.util.Arrays;
/**
* @auther: wilson
* @version: v1.0 创建时间: 2019-12-23:2019
* Des:快速排序
*/
public class QuickSort {
public static Integer[] sort(Integer[] sourceArray) {
// 对 arr 进行拷贝，不改变参数内容
Integer[] arr = Arrays.copyOf(sourceArray, sourceArray.length);
return quickSort(arr, 0, arr.length - 1);
}
private static Integer[] quickSort(Integer[] arr, Integer left, Integer right) {
if (left < right) {
Integer partitionIndex = partition(arr, left, right);
quickSort(arr, left, partitionIndex - 1);
quickSort(arr, partitionIndex + 1, right);
}
return arr;
}
private static Integer partition(Integer[] arr, Integer left, Integer right) {
// 设定基准值（pivot）
int pivot = arr[left];
while (left < right) {
while (left < right && arr[right] >= pivot) {
right--;
}
if (left < right) {
arr[left++] = arr[right];
}
while (left < right && arr[left] <= pivot) {
left++;
}
if (left < right) {
arr[right--] = arr[left];
}
}
arr[left] = pivot;
return left;
}
private static void swap(Integer[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}