-
Notifications
You must be signed in to change notification settings - Fork 9
/
QuickSort.java
33 lines (31 loc) · 951 Bytes
/
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
import java.util.Arrays;
public class QuickSort{
public static void main(String[] args) {
int[] arr = new int[]{3,4,6,7,2,7,2,8,0,9};
QuickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
}
public static void QuickSort(int[] data,int left,int right){
if(left<right){
int low = left;
int high = right;
int base = data[left];
while(low<high){
//from right side
while(low<high&&base<=data[high]){
high--;
}
//swap
data[low]=data[high];
//from left side
while(low<high&&base>=data[low]) {
low++;
}
data[high]=data[low];
}
data[low]=base;
QuickSort(data,left,low);
QuickSort(data,low+1,right);
}
}
}