forked from uditkumar489/HacktoberFest-HelloWorld
-
Notifications
You must be signed in to change notification settings - Fork 0
/
mergesort.java
82 lines (69 loc) · 1.7 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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
package p;
import java.util.Scanner;
public class mergesort {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] input = takeInput();
mergeSort(input);
printArray(input);
}
public static int[] takeInput() {
Scanner s = new Scanner(System.in);
int size = s.nextInt();
int arr[] = new int[size];
for (int i = 0; i < size; i++) {
arr[i] = s.nextInt();
}
return arr;
}
public static void printArray(int input[]) {
for(int i = 0; i < input.length; i++) {
System.out.print(input[i] + " ");
}
}
public static void mergeSort(int[] input){
// Write your code here
mergesorted(input,0,input.length-1);
}
private static void mergesorted(int[] input, int si,int ei){
if(si>=ei){
return;
}
int mid= (si+ei)/2;
mergesorted(input,si,mid);
mergesorted(input,mid+1,ei);
merge(input,si,ei);
}
private static void merge(int[] input, int si,int ei){
int mid= (si+ei)/2;
int j=mid+1;
int i=si;
int c=0;
int[] temp= new int[ei-si+1];
while(i<=mid && j<=ei){
if(input[i]<input[j]){
temp[c]=input[i];
i++;
c++;
}
else{
temp[c]=input[j];
j++;
c++;
}
}
while(i<mid+1){
temp[c]=input[i];
i++;
c++;
}
while(j<ei+1){
temp[c]=input[j];
j++;
c++;
}
for(int k= 0;k<temp.length;k++){
input[si+k]=temp[k];
}
}
}