-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuickSorter.java
More file actions
43 lines (34 loc) · 853 Bytes
/
QuickSorter.java
File metadata and controls
43 lines (34 loc) · 853 Bytes
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
package sort2;
import java.util.Arrays;
public class QuickSorter {
public void sort(Integer[] data) {
quicksort(data, 0, data.length-1);
}
public void quicksort(Integer[] data, int start, int end) {
if (start < end) {
int pivotIndex = partition(data, start, end);
quicksort(data, start, pivotIndex-1);
quicksort(data, pivotIndex+1, end);
}
}
private int partition(Integer[] data, int start, int end) {
int pivot = data[end];
int i = start;
for (int j = start; j <= end - 1; j++) {
if (data[j] < pivot) {
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
i++;
}
}
data[end] = data[i];
data[i] = pivot;
return i;
}
public static void main(String[] args) {
Integer[] data = {25,5,7,2,18,23,12,18};
new QuickSorter().sort(data);
System.out.println(Arrays.toString(data));
}
}