Repository navigation
Expand file tree
/
Copy pathMainClass.java
More file actions
94 lines (78 loc) · 1.58 KB
/
Copy pathMainClass.java
File metadata and controls
94 lines (78 loc) · 1.58 KB
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
package sorting2;
public class MainClass {
static void mergeSort(int a[], int l, int h) {
if(l < h) {
int mid = (l+h)/2;
mergeSort(a, l, mid);
mergeSort(a, mid+1, h);
merge(a, l, mid, h);
}
}
static void merge(int[] a, int l, int mid, int h) {
int b[] = new int[a.length];
int i = l; // i is for left subarray
int j = mid+1; // j is for right subarray
int k = l; // k is for b[]
while(i <= mid && j <= h) {
if(a[i] <= a[j]) {
b[k] = a[i];
i++;
} else {
b[k] = a[j];
j++;
}
k++;
}
if(i > mid) {
while(j <= h) {
b[k] = a[j];
k++; j++;
}
} else {
while(i <= mid) {
b[k] = a[i];
k++; i++;
}
}
for(i = l; i<=h; i++) {
a[i] = b[i];
}
}
static void swap(int a[], int i, int j) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
static void random(int a[], int l, int h) {
int randomIndex = l + (int)(Math.random() * (h-l+1));
swap(a, l, randomIndex);
}
static int partition(int a[], int l, int h) {
int i = l;
int j = h;
random(a, l, h);
int pivot = a[l];
while(i < j) {
while(i < j && a[i] <= pivot) i++;
while(a[j] > pivot) j--;
if(i < j) {
swap(a, i, j);
}
}
swap(a, l, j);
return j;
}
static void quickSort(int a[], int l, int h) {
if(l < h) {
int pivot = partition(a, l, h);
quickSort(a, l, pivot-1);
quickSort(a, pivot+1, h);
}
}
public static void main(String[] args) {
int a[] = {5, 1, 9, 5, 3, 1, 2, 1, 2, 3};
// quickSort(a, 0, a.length-1);
mergeSort(a, 0, a.length-1);
for(int e: a) System.out.print(e+" ");
}
}