-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathQuickSort.java
45 lines (37 loc) · 1.13 KB
/
QuickSort.java
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
import java.util.Random;
public class QuickSort {
public static void quickSort(int[] arr, int left, int right){
int l = left;
int r = right - 1;
int size = right - left;
if(size > 1){
Random rn = new Random();
int pivot = arr[rn.nextInt(size) + l];
while(l < r){
while(arr[r] > pivot && r > l){
r--;
}
while(arr[l] < pivot && l <= r){
l++;
}
if(l < r){
int temp = arr[l];
arr[l] = arr[r];
arr[r] = temp;
}
}
quickSort(arr, left, l);
quickSort(arr, r, right);
}
}
public static void printArray(int[] arr){
for(int i = 0; i < arr.length; i++){
System.out.print(arr[i] + " ");
}
}
public static void main(String[] args) {
int[] arr = {10, 54, 63, 6, 420, 11, 41, 32, 17, 22};
quickSort(arr, 0, arr.length);
printArray(arr);
}
}