-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmerge_sort.java
More file actions
73 lines (66 loc) · 1.77 KB
/
Copy pathmerge_sort.java
File metadata and controls
73 lines (66 loc) · 1.77 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
65
66
67
68
69
70
71
72
73
import java.util.*;
public class merge_sort{
public static void mergeSort(int[] arr){
int length=arr.length;
if(length<=1){
return;
}
int mid=length/2;
int[] leftArray=new int[mid];
int[] rightArray=new int[length-mid];
int i=0;
int j=0;
for(;i<length;i++){
if(i<mid){
leftArray[i]=arr[i];
}
else{
rightArray[j]=arr[i];
j++;
}
}
mergeSort(leftArray);
mergeSort(rightArray);
merge(leftArray,rightArray,arr);
}
public static void merge(int[] leftArray, int[] rightArray, int[] arr){
int length=arr.length;
int left=length/2;
int right=length-left;
int i=0, l=0, r=0;
while(l<left && r<right){
if(leftArray[l]<rightArray[r]){
arr[i]=leftArray[l];
i++;
l++;
}
else{
arr[i]=rightArray[r];
i++;
r++;
}
}
while(l<left){
arr[i]=leftArray[l];
i++;
l++;
}
while(r<right){
arr[i]=rightArray[r];
i++;
r++;
}
}
public static void main(String args[]){
Scanner scanner =new Scanner(System.in);
System.out.println("Enter the size of array: ");
int size=scanner.nextInt();
int[] arr=new int[size];
for(int i=0;i<size;i++){
arr[i]=scanner.nextInt();
}
System.out.println("Original arrays is: "+Arrays.toString(arr));
mergeSort(arr);
System.out.println("Merge sort array is: "+ Arrays.toString(arr));
}
}