-
Notifications
You must be signed in to change notification settings - Fork 0
/
MergeSort.java
61 lines (52 loc) · 1.4 KB
/
MergeSort.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
package Sorting;
// @author lemidia
public class MergeSort {
static void divide(int data[], int p, int r){
if(p<r){
int q = (p+r)/2;
divide(data, p, q);
divide(data,q+1, r);
merge(data, p, q, r);
}
}
static void merge(int data[], int p, int q, int r){
int i = p; int j = q+1; int k = p;
int temp[] = new int[data.length];
/*
while (i<=q && j<=r){
if(data[i] <= data[j]){
temp[k++] = data[i++];
}else{
temp[k++] = data[j++];
}
}
while (i<=q)
temp[k++] = data[i++];
while (j<=r)
temp[k++] = data[j++];
for(int l = p; l<=r; l++){
data[l] = temp[l];
}
*/
for (int l = p; l < r+1 ; l++) {
if (i<=q && (j>r || data[i] < data[j])){
temp[k++] = data[i++];
}else
temp[k++] = data[j++];
}
for(int l = p; l<=r; l++){
data[l] = temp[l];
}
}
public static void main(String[] args) {
int limit = 10;
int arr[] = new int[limit];
for(int i = limit-1; i>=0; --i){
arr[i] = limit-i;
}
divide(arr, 0, limit-1);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
}