-
Notifications
You must be signed in to change notification settings - Fork 0
/
quicksort
40 lines (34 loc) · 910 Bytes
/
quicksort
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
public static String[] quickSort(String[] strArr, int p, int r)
{
if(p<r)
{
int q=partition(strArr,p,r);
quickSort(strArr,p,q);
quickSort(strArr,q+1,r);
}
return strArr;
}
private static int partition(String[] strArr, int p, int r) {
String x = strArr[p];
int i = p-1 ;
int j = r+1 ;
while (true)
{
i++;
while ( i< r && strArr[i].compareTo(x) < 0)
i++;
j--;
while (j>p && strArr[j].compareTo(x) > 0)
j--;
if (i < j)
swap(strArr, i, j);
else
return j;
}
}
private static void swap(String[] strArr, int i, int j)
{
String temp = strArr[i];
strArr[i] = strArr[j];
strArr[j] = temp;
}