-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeSort.java
More file actions
89 lines (68 loc) · 2.03 KB
/
MergeSort.java
File metadata and controls
89 lines (68 loc) · 2.03 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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
import java.util.Scanner;
public class MergeSort {
static void merge(int[] arr, int start, int mid, int end){
int l1 = mid - start +1;
int l2 = end - mid;
int[] leftSubArray = new int[l1];
int[] rightSubArray = new int[l2];
for (int i = 0; i < l1; i++) {
leftSubArray[i] = arr[start + i];
}
for (int j = 0; j < l2; j++) {
rightSubArray[j] = arr[mid + 1 + j];
}
int i=0, j=0, k=start;
while(i<l1 && j<l2){
if (leftSubArray[i] <= rightSubArray[j]) {
arr[k] = leftSubArray[i];
i++;
k++;
}
else{
arr[k] = rightSubArray[j];
j++;
k++;
}
}
while(i<l1){
arr[k] = leftSubArray[i];
i++;
k++;
}
while(j<l2){
arr[k] = rightSubArray[j];
j++;
k++;
}
}
static void sort(int[] arr, int start, int end){
if(start < end){
int mid = start + (end-start)/2;
sort(arr, start, mid);
sort(arr, mid+1, end);
merge(arr, start, mid, end);
}
}
static void printArray(int[] arr){
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter the array size : ");
int len = sc.nextInt();
int[] arr = new int[len];
System.out.println("Enter the array elements : ");
for (int i = 0; i < len; i++) {
arr[i] = sc.nextInt();
}
MergeSort ob = new MergeSort();
System.out.println("The array before sorting : ");
ob.printArray(arr);
System.out.println("The array after sorting : ");
ob.sort(arr, 0, len-1);
ob.printArray(arr);
}
}