-
Notifications
You must be signed in to change notification settings - Fork 0
/
QuickSort.java
41 lines (37 loc) · 1.07 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
public class QuickSort {
public static int partition(int arr[], int low, int high) {
int pivot = arr[high];
int i = low - 1;
for (int j = low; j < high; j++) {
if (arr[j] < pivot) {
i++;
// swap
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
// swap with pivot
i++;
int temp = arr[i];
arr[i] = arr[high];
arr[high] = temp;
return i;
}
public static void quickSort(int arr[], int low, int high) {
if (low < high) {
int pidx = partition(arr, low, high);
quickSort(arr, low, pidx - 1);
quickSort(arr, pidx + 1, high);
}
}
public static void main(String[] args) {
int arr[] = { 2, 3, 7, 5, 9, 8 };
int n = arr.length;
quickSort(arr, 0, n - 1);
// print
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
}