java/MergeSort_Strings at main · Vinuthnavadikari/java · GitHub

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
public class Solution{
    public static String[] mergeSort(String[] arr,int lo,int hi){
        if(lo==hi){
            String[] A ={(arr[lo])};

            return A;

        }
    int mid=lo+(hi-lo)/2;
    String[] arr1=mergeSort(arr, lo, mid);
    String[] arr2=mergeSort(arr, mid+1, hi);
    String[] arr3=merge(arr1,arr2);
    return arr3;


}
static String[] merge(String[]arr1,String[]arr2){
    int m=arr1.length;
    int n=arr2.length;
    String[] arr3 = new String[m+n];
    int idx=0;
    int i=0;
    int j=0;
    while (i<m && j<n){
        if(isAlphabeticallySmaller(arr1[i],arr2[j])){
            arr3[idx]=arr1[i];
            i++;
            idx++;

        }
        else{
            arr3[idx]=arr2[j];
            j++;
            idx++;
        }


    }
    while(i<m){
        arr3[idx]=arr1[i];
        i++;
        idx++;
    }
    while(j<n){
        arr3[idx]=arr2[j];
        j++;
        idx++;

    }
    return arr3;
}
static boolean isAlphabeticallySmaller(String str1,String str2){
    if (str1.compareTo(str2) < 0) {
        return true;
        }
        return false;
        }
        public static void main(String[] args) {
        String[] arr = { "sun", "earth", "mars", "mercury" };
        String[] a = mergeSort(arr, 0, arr.length - 1);
        for (int i = 0; i < a.length; i++) {
        System.out.print(a[i]+" ");
        }

}
}