-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathClassFieldTrip.java
More file actions
60 lines (53 loc) · 1.52 KB
/
Copy pathClassFieldTrip.java
File metadata and controls
60 lines (53 loc) · 1.52 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
import java.util.Scanner;
public class ClassFieldTrip {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String ann = sc.nextLine();
String ben = sc.nextLine();
char[] both = (ann+ben).toCharArray();
mergeSort(both);
System.out.println(both);
}
public static void mergeSort(char[] arr) {
//base case
if(arr.length == 1) return;
//recursive call
int leftLength = arr.length/2;
int rightLength = arr.length-arr.length/2;
char[] left = new char[leftLength];
for (int i = 0; i < left.length; i++) {
left[i] = arr[i];
}
char[] right = new char[rightLength];
for (int i = 0; i < right.length; i++) {
right[i] = arr[leftLength+i];
}
mergeSort(left);
mergeSort(right);
merge(left,right,arr);
}
public static void merge(char[] left, char[] right, char[] original) {
int i = 0, j = 0, k = 0;
while(i<left.length && j<right.length){
if(left[i] < right[j]){
original[k] = left[i];
i++;
}
else{
original[k] = right[j];
j++;
}
k++;
}
while(i<left.length){
original[k] = left[i];
i++;
k++;
}
while(j<right.length){
original[k] = right[j];
j++;
k++;
}
}
}