Solution to sort using merge functionality

deepcodingios · deepcodingios · commit dd0c80ac5f67 · 2023-03-11T23:26:37.000+05:30
diff --git a/src/Sorting/SortingProblems.java b/src/Sorting/SortingProblems.java
@@ -10,6 +10,12 @@ public static void main(String[] args) {
 //        int [] A = {1, 1, 3, 3};
 //        int [] A = {0, 1, 2, 0, 1, 2};
 //        int [] A = {0};
+        int firstArray [] = {3,7,8,9,10,1,2,3};
+        int secondArray [] = {2,5,6,11,12};
+//        int finalArray [] = mergeSortedArrays(firstArray,secondArray);
+//        System.out.println(Arrays.toString(finalArray));
+
+        System.out.println(Arrays.toString(merge(firstArray,0,firstArray.length/2,firstArray.length-1)));
         int [] A = {2, 0, 0, 1, 0, 0, 2, 2, 1, 1, 0, 0, 1, 0, 2, 1, 1, 0, 1, 0, 1, 2, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 1, 2, 2, 1, 0, 2, 2, 1, 1, 1, 0, 1, 0, 1, 0, 2, 1, 2, 0, 2, 0, 1, 1, 0, 2, 2, 1, 2, 0, 2, 1, 1, 1, 2, 0, 1, 0, 2, 2, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 2, 1, 1, 0, 2, 1, 2, 0, 0, 0, 2, 2, 2, 2, 0, 0, 0, 1, 1, 0, 2, 1, 2, 2, 2, 1, 2, 2, 0, 1, 0, 1, 2, 1, 1, 0, 1, 2, 0, 1, 0, 2, 2, 1, 2, 1, 0, 2, 2, 1, 1, 0, 2, 1, 2};
         int [] answerArray = sortColors(A);
         System.out.println(Arrays.toString(answerArray));
@@ -18,6 +24,69 @@ public static void main(String[] args) {
         System.out.println(result);
     }
 
+    static int [] merge(int [] A, int s, int m,int e){
+
+        int [] finalArray = new int[e-s+1];
+
+        int p1 = s; int p2 = m+1; int p3 = 0;
+
+        while (s <= m && p2 <= e){
+            if (A[p1] < A[p2]){
+                finalArray[p3] = A[p1];
+                p1++;
+                p3++;
+            }else {
+                finalArray[p3] = A[p2];
+                p2++;
+                p3++;
+            }
+        }
+        while (p1 <= m){
+            finalArray[p3] = A[p1];
+            p1++;
+            p3++;
+        }
+        while (p2 <= e){
+            finalArray[p3] = A[p2];
+            p2++;
+            p3++;
+        }
+
+        return finalArray;
+    }
+
+    static int [] mergeSortedArrays(int [] A, int [] B){
+
+        int p1 = 0; int p2 = 0; int p3 = 0;
+
+        int [] finalArray = new int[A.length+B.length];
+
+        while (p1 < A.length && p2 < B.length){
+            if (A[p1] < B[p2]){
+                finalArray[p3] = A[p1];
+                p1++;
+                p3++;
+            }else {
+                finalArray[p3] = B[p2];
+                p2++;
+                p3++;
+            }
+        }
+        while (p1 < A.length){
+            finalArray[p3] = A[p1];
+            p1++;
+            p3++;
+        }
+        while (p2 < B.length){
+            finalArray[p3] = B[p2];
+            p2++;
+            p3++;
+        }
+
+        return finalArray;
+
+    }
+
     static int nobleInteger(int [] A){
 
         HashMap<Integer,Integer> hashMap_1 = new HashMap<>();
