BAEL - 3482

algorithms-miscellaneous-5/src/test/java/com/baeldung/algorithms/minheapmerge/MinHeapMergeUnitTest.java

@@ -6,29 +6,33 @@ import static org.junit.Assert.assertThat;
 
 import org.junit.Test;
 
-public class MinHeapmergeUnitTest {
+public class MinHeapMergeUnitTest {
 
     private final int[][] inputArray = { { 0, 6 }, { 1, 5, 10, 100 }, { 2, 4, 200, 650 } };
     private final int[] expectedArray = { 0, 1, 2, 4, 5, 6, 10, 100, 200, 650 };
 
     @Test
-    public void givenSortedArraysWhenMergedShouldReturnASingleSortedarray() {
+    public void givenSortedArrays_whenMerged_thenShouldReturnASingleSortedarray() {
         int[] resultArray = MinHeapMerge.merge(inputArray);
+        
         assertThat(resultArray.length, is(equalTo(10)));
         assertThat(resultArray, is(equalTo(expectedArray)));
     }
     
     @Test
-    public void givenEmptyHeapNodesAndInputArrayWhenPopulatedShouldPopulateAndReturnResultArrayLength() {
+    public void givenEmptyHeapNodesAndInputArray_whenPopulated_thenShouldPopulateAndReturnResultArrayLength() {
         int size = MinHeapMerge.populateHeapNodesAndDetermineResultingArrayLength(inputArray, new HeapNode[inputArray.length]);
+        
         assertThat(size, is(equalTo(10)));
     }
     
     @Test
-    public void givenArrayAndHeapNodesAndResultArraySizeWhenMergedShouldReturnASingleSortedarray() {
+    public void givenArrayAndHeapNodesAndResultArraySize_whenMerged_thenShouldReturnASingleSortedarray() {
         HeapNode[] heapNodes = new HeapNode[inputArray.length];
         int size = MinHeapMerge.populateHeapNodesAndDetermineResultingArrayLength(inputArray, heapNodes);
+        
         int[] resultArray = MinHeapMerge.createMinHeapAndMergeArrays(inputArray, heapNodes, size);
+        
         assertThat(resultArray.length, is(equalTo(10)));
         assertThat(resultArray, is(equalTo(expectedArray)));
     }