-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmerge.java
More file actions
71 lines (66 loc) · 1.2 KB
/
merge.java
File metadata and controls
71 lines (66 loc) · 1.2 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
import java.util.Scanner ;
public class merge{
public static void merge(int arr[],int left,int right){
if(left<right){
int mid=left+(right-left)/2;
merge(array,left,mid);
merge(arr,mid+1,right);
merge(arr,left,mid,right);
}
}
public static void mer(int[] arr,int left,int mid,int right){
int n1=mid-left+1;
int n2=right-mid;
int[] leftarr=new int [n1];
int[] rightarr=new int[n2];
for(int i=0;i<n1;i++){
leftarr[i]=arr[left+1];
}
for(int j=0;j<n2;++j){
rightarr[j]=arr[mid+1+j];
}
int i=0,j=0,k=left;
while(i<n1 && j<n2){
if(leftarr[i]<=rightarr[j]){
arr[k]=leftarr[i];
++i;
}
else{
arr[k]=rightarr[j];
++j;
}
++k;
while(i<n1){
arr[k]=leftarr[i];
++i;
++k;
}
while(j<n2){
arr[k]=rightarr[j];
++j;
++k;
}
}
public static void main(String[] args){
Scanner scanner=new Scanner(System.in);
System.out.print("enter a number of elements");
int n=scanner.nextInt();
int[] arr=new int[n];
System.out.print("enter a elements:");
for(int i=0;i<n;i++){
arr[i]=scanner.nextInt();
}
System.out.print("entered array:");
for(int num :arr){
System.out.print(num+" ");
}
System.out.println();
merge(arr,0,n-1);
system.out.print("sorted array:");
for(int num:arr){
System.out.print(num+" ");
}
System.out.println();
scanner.close();
}
}