-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuickSort.java
More file actions
49 lines (42 loc) · 1.2 KB
/
QuickSort.java
File metadata and controls
49 lines (42 loc) · 1.2 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
package Sorting;
public class QuickSort {
public static void quickSort(int[] array) {
sort(array, 0, array.length - 1);
}
private static void sort(int[] array, int p, int r) {
if (p < r) {
int q = partition(array, p, r);
sort(array, p, q - 1);
sort(array, q + 1, r);
}
}
private static int partition(int[] array, int p, int r) {
int randomIndex = p + (int) (Math.random() * (r - p + 1));
swap(array, randomIndex, r);
int i = p - 1, j = p;
while (j < r) {
if (array[j] < array[r]) {
swap(array, ++i, j);
}
j++;
}
swap(array, ++i, r);
return i;
}
private static void swap(int[] array, int i, int j) {
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
public static void main(String[] args) {
int[] numbers = {3, 1, 4, 2, -2, 5, 10, 1};
for (int n : numbers) {
System.out.print(n + " ");
}
quickSort(numbers);
System.out.println();
for (int n : numbers) {
System.out.print(n + " ");
}
}
}