-
Notifications
You must be signed in to change notification settings - Fork 1
/
Sorting.java
112 lines (99 loc) · 2.63 KB
/
Sorting.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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
import java.io.*;
import java.util.*;
public class Sorting {
private static Random random = new Random();
private static int[] partition3(int[] a, int l, int r) {
//write your code here
int x = a[r];
int k = l;
while(k <= r){
if( a[k] < x){
int t = a[l];
a[l] = a[k];
a[k] = t;
l++;
k++;
}else if (a[k] == x){
k++;
}
else if(a[k] > x){
int t = a[r];
a[r] = a[k];
a[k] = t;
r--;
}
}
int m1 = l-1;
int m2 = k;
int[] m = {m1, m2};
return m;
}
private static int partition2(int[] a, int l, int r) {
int x = a[l];
int j = l;
for (int i = l + 1; i <= r; i++) {
if (a[i] <= x) {
j++;
int t = a[i];
a[i] = a[j];
a[j] = t;
}
}
int t = a[l];
a[l] = a[j];
a[j] = t;
return j;
}
private static void randomizedQuickSort(int[] a, int l, int r) {
if (l >= r) {
return;
}
if(l -r == 1){
if(a[l] < a[r]){
int t = a[r];
a[r] = a[l];
a[l] = t;
}
return;
}
int[] m = partition3(a, l, r);
randomizedQuickSort(a, l, m[0] );
randomizedQuickSort(a, m[1] , r);
}
public static void main(String[] args) {
FastScanner scanner = new FastScanner(System.in);
int n = scanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = scanner.nextInt();
}
randomizedQuickSort(a, 0, n - 1);
for (int i = 0; i < n; i++) {
System.out.print(a[i] + " ");
}
}
static class FastScanner {
BufferedReader br;
StringTokenizer st;
FastScanner(InputStream stream) {
try {
br = new BufferedReader(new InputStreamReader(stream));
} catch (Exception e) {
e.printStackTrace();
}
}
String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
}
}