-
Notifications
You must be signed in to change notification settings - Fork 0
/
RandomisedQuickSort.java
69 lines (50 loc) · 1.65 KB
/
RandomisedQuickSort.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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
package com.iamoperand;
/**
* Created by iamoperand on 3/7/17.
*/
public class RandomisedQuickSort {
void quickSort(int a[], int startIndex, int endIndex){
if(startIndex < endIndex){
int pivotIndex = randomisedPartition(a, startIndex, endIndex);
quickSort(a, startIndex, pivotIndex-1);
quickSort(a, pivotIndex+1, endIndex);
}
}
int randomisedPartition(int a[], int startIndex, int endIndex){
int pivotIndex = (int) (startIndex + (Math.random()*10)%((endIndex-startIndex)+1));
int temp = a[endIndex];
a[endIndex] = a[pivotIndex];
a[pivotIndex] = temp;
int returnedPivotIndex = partition(a, startIndex, endIndex);
return returnedPivotIndex;
}
int partition(int a[], int startIndex, int endIndex){
int pivotIndex = startIndex;
int pivot = a[endIndex];
for(int i=startIndex; i<endIndex; i++){
if(a[i] <= pivot){
int temp = a[pivotIndex];
a[pivotIndex] = a[i];
a[i] = temp;
pivotIndex++;
}
}
int temp = a[pivotIndex];
a[pivotIndex] = a[endIndex];
a[endIndex] = temp;
return pivotIndex;
}
void printArray(int a[]) {
int n = a.length;
for (int i = 0; i < n; ++i)
System.out.print(a[i] + " ");
System.out.println();
}
public static void main(String args[]){
RandomisedQuickSort rq = new RandomisedQuickSort();
int a[] = {3, 4, 7, 5, 2, 1};
int n = a.length;
rq.quickSort(a, 0, n-1);
rq.printArray(a);
}
}