Java/Mergesort.java at main · gulafsh/Java · GitHub

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
publicclassMergeSort
{
publicstaticvoidconquer(intarr[],intsi, intmid, intei){
intmerged[] = newint[ei-si+1];
intindex1 = si;
intindex2 = mid+1;
intx = 0; // index of merged array
while(index1<=mid && index2<=ei){
if(arr[index1]<=arr[index2]){
merged[x++]=arr[index1++];
 }
else{
merged[x++]=arr[index2++];
 }
 }

while(index1<=mid){
merged[x++]=arr[index1++];
 }

while(index2<=ei){
merged[x++]=arr[index2++];
 }

for(inti=0, j=si;i<merged.length;i++,j++){
arr[j]=merged[i];
 }
 }
publicstaticvoiddivide(intarr[],intsi,intei){
if(si>=ei)
return;

intmid = si +(ei-si)/2;
divide(arr,si,mid);
divide(arr,mid+1,ei);
conquer(arr,si,mid, ei);
 }
publicstaticvoidmain(Stringargs[])
 {
intarr[] = {1,2,6,2,4,79,4};
divide(arr,0,arr.length-1);
for(inti=0;i<arr.length;i++){
System.out.print(arr[i]+" ");
 }
 }
}