-
Notifications
You must be signed in to change notification settings - Fork 20
/
inPlaceMergeSort.java
58 lines (55 loc) · 1.01 KB
/
inPlaceMergeSort.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
package com.company;
import java.util.Arrays;
public class inPlaceMergeSort {
public static void main(String[] args) {
int[] arr={4,2,1,3,7,5,6,9,8,10,13,12,11,15,16,14};
sort(arr,0,arr.length);
System.out.println(Arrays.toString(arr));
}
static void sort(int[] arr,int s,int e)
{
if(e-s==1)
{
return;
}
int m=s+(e-s)/2;
sort(arr,s,m);
sort(arr,m,e);
merge(arr,s,m,e);
}
static void merge(int[] arr,int s,int m,int e)
{
int[] mix=new int[e-s];
int i=s,j=m,k=0;
while(i<m && j<e)
{
if(arr[i]<arr[j])
{
mix[k]=arr[i];
i++;
}
else
{
mix[k]=arr[j];
j++;
}
k++;
}
while(i<m)
{
mix[k]=arr[i];
i++;
k++;
}
while(j<e)
{
mix[k]=arr[j];
j++;
k++;
}
for(int l=0;l<mix.length;l++)
{
arr[s+l]=mix[l];
}
}
}