BAEL-3399: How to merge two sorted arrays into a sorted array

2019-11-24 15:19:28 +05:30
parent b9e46ff27a
commit 2f020d30ba
2 changed files with 61 additions and 0 deletions
@@ -0,0 +1,34 @@
+package com.baeldung.algorithms.sortedarrays;
+
+public class SortedArrays {
+
+    public static int[] merge(int[] first, int[] second) {
+
+        int m = first.length;
+        int n = second.length;
+
+        int i, j, k;
+        i = j = k = 0;
+
+        int[] result = new int[m + n];
+
+        while (i < m && j < n) {
+
+            if (first[i] < second[j]) {
+                result[k++] = first[i++];
+            } else {
+                result[k++] = second[j++];
+            }
+        }
+
+        while (i < m) {
+            result[k++] = first[i++];
+        }
+
+        while (j < n) {
+            result[k++] = second[j++];
+        }
+
+        return result;
+    }
+}