-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRecursion.java
More file actions
64 lines (58 loc) · 2.01 KB
/
Recursion.java
File metadata and controls
64 lines (58 loc) · 2.01 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
public class Recursion {
public static void main(String[] args) {
int ary[] = { 12, 54, 91, 23, 45, 67, 38, 82, 16, 29,
33, 77, 64, 50, 89, 72, 18, 39, 55, 93,
26, 47, 61, 84, 70, 35, 48, 95, 60, 73,
11, 28, 49, 66, 53, 83, 40, 71, 24, 56,
19, 32, 59, 90, 44, 87, 21, 63, 14, 34,
78, 57, 25, 52, 80, 37, 62, 15, 41, 68,
76, 27, 31, 86, 46, 13, 75, 22, 94, 30,
43, 58, 81, 17, 69, 36, 74, 20, 92, 51,
85, 65, 42, 88, 79, 96, 10, 99, 20, 66,
31, 55, 50, 44, 77, 33, 71, 91, 25, 38 };
printAry(ary);
long startTime = System.currentTimeMillis();
mergesort(ary, 0, ary.length - 1);
long endTime = System.currentTimeMillis();
printAry(ary);
long timeTaken = endTime - startTime;
System.out.println("Time taken : " + timeTaken + " ms");
}
public static void printAry(int ary[]) {
for (int x : ary) {
System.out.print(x + " ");
}
System.out.println();
}
public static void mergesort(int ary[], int left, int right) {
if (left >= right) {
return;
}
int mid = left + (right - left) / 2; // This caused trouble
mergesort(ary, left, mid);
mergesort(ary, mid + 1, right);
merge(ary, left, mid, right);
}
public static void merge(int ary[], int left, int mid, int right) {
int temp[] = new int[right - left + 1];
int i = left;
int j = mid + 1;
int k = 0;
while (i <= mid && j <= right) {
if (ary[i] < ary[j]) {
temp[k++] = ary[i++];
} else {
temp[k++] = ary[j++];
}
}
while (j <= right) {
temp[k++] = ary[j++];
}
while (i <= mid) {
temp[k++] = ary[i++];
}
for (k = 0, i = left; k < temp.length; k++, i++) {
ary[i] = temp[k];
}
}
}