iSharkFly-Docs/java-tutorials
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

BAEL-3399: How to merge two sorted arrays (based on review)

Browse Source
This commit is contained in:
Vivek Balasubramaniam 2019-12-15 18:57:20 +05:30
parent 277a1ee266
commit 792545e655
4 changed files with 62 additions and 61 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
algorithms-miscellaneous-5/src/main/java/com/baeldung/algorithms/mergesortedarrays/SortedArrays.java Normal file
View File

@ -0,0 +1,33 @@
package com.baeldung.algorithms.mergesortedarrays;
public class SortedArrays {
public static int[] merge(int[] foo, int[] bar) {
int fooLength = foo.length;
int barLength = bar.length;
int[] merged = new int[fooLength + barLength];
int fooPosition, barPosition, mergedPosition;
fooPosition = barPosition = mergedPosition = 0;
while (fooPosition < fooLength && barPosition < barLength) {
if (foo[fooPosition] < bar[barPosition]) {
merged[mergedPosition++] = foo[fooPosition++];
} else {
merged[mergedPosition++] = bar[barPosition++];
}
}
while (fooPosition < fooLength) {
merged[mergedPosition++] = foo[fooPosition++];
}
while (barPosition < barLength) {
merged[mergedPosition++] = bar[barPosition++];
}
return merged;
}
}

34
algorithms-miscellaneous-5/src/main/java/com/baeldung/algorithms/sortedarrays/SortedArrays.java
View File

@ -1,34 +0,0 @@
package com.baeldung.algorithms.sortedarrays;
public class SortedArrays {
public static int[] merge(int[] first, int[] second) {
int firstLength = first.length;
int secondLength = second.length;
int[] result = new int[firstLength + secondLength];
int firstPosition, secondPosition, resultPosition;
firstPosition = secondPosition = resultPosition = 0;
while (firstPosition < firstLength && secondPosition < secondLength) {
if (first[firstPosition] < second[secondPosition]) {
result[resultPosition++] = first[firstPosition++];
} else {
result[resultPosition++] = second[secondPosition++];
}
}
while (firstPosition < firstLength) {
result[resultPosition++] = first[firstPosition++];
}
while (secondPosition < secondLength) {
result[resultPosition++] = second[secondPosition++];
}
return result;
}
}

29
algorithms-miscellaneous-5/src/test/java/com/baeldung/algorithms/mergesortedarrays/SortedArraysUnitTest.java Normal file
View File

@ -0,0 +1,29 @@
package com.baeldung.algorithms.mergesortedarrays;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import org.junit.jupiter.api.Test;
import com.baeldung.algorithms.mergesortedarrays.SortedArrays;
public class SortedArraysUnitTest {
@Test
public void givenTwoSortedArrays_whenMerged_thenReturnMergedSortedArray() {
int[] foo = { 3, 7 };
int[] bar = { 4, 8, 11 };
int[] merged = { 3, 4, 7, 8, 11 };
assertArrayEquals(merged, SortedArrays.merge(foo, bar));
}
@Test
public void givenTwoSortedArraysWithDuplicates_whenMerged_thenReturnMergedSortedArray() {
int[] foo = { 3, 3, 7 };
int[] bar = { 4, 8, 8, 11 };
int[] merged = { 3, 3, 4, 7, 8, 8, 11 };
assertArrayEquals(merged, SortedArrays.merge(foo, bar));
}
}

27
algorithms-miscellaneous-5/src/test/java/com/baeldung/algorithms/sortedarrays/SortedArraysUnitTest.java
View File

@ -1,27 +0,0 @@
package com.baeldung.algorithms.sortedarrays;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import org.junit.jupiter.api.Test;
public class SortedArraysUnitTest {
@Test
public void givenTwoSortedArraysWhenMergeThenReturnMergedSortedArray() {
int[] first = { 3, 7 };
int[] second = { 4, 8, 11 };
int[] result = { 3, 4, 7, 8, 11 };
assertArrayEquals(result, SortedArrays.merge(first, second));
}
@Test
public void givenTwoSortedArraysWithDuplicatesWhenMergeThenReturnMergedSortedArray() {
int[] first = { 3, 3, 7 };
int[] second = { 4, 8, 8, 11 };
int[] result = { 3, 3, 4, 7, 8, 8, 11 };
assertArrayEquals(result, SortedArrays.merge(first, second));
}
}