diff --git a/algorithms/src/test/java/algorithms/insertionsort/InsertionSortUnitTest.java b/algorithms/src/test/java/com/baeldung/algorithms/insertionsort/InsertionSortUnitTest.java
similarity index 66%
rename from algorithms/src/test/java/algorithms/insertionsort/InsertionSortUnitTest.java
rename to algorithms/src/test/java/com/baeldung/algorithms/insertionsort/InsertionSortUnitTest.java
index a5d19cb41d..b3d7e8c534 100644
--- a/algorithms/src/test/java/algorithms/insertionsort/InsertionSortUnitTest.java
+++ b/algorithms/src/test/java/com/baeldung/algorithms/insertionsort/InsertionSortUnitTest.java
@@ -1,4 +1,4 @@
-package algorithms.insertionsort;
+package com.baeldung.algorithms.insertionsort;
 
 import com.baeldung.algorithms.insertionsort.InsertionSort;
 import org.junit.Test;
@@ -8,7 +8,7 @@ import static org.junit.Assert.assertArrayEquals;
 public class InsertionSortUnitTest {
 
     @Test
-    public void givenUnsortedArray_whenInsertionSortImperatively_thenItIsSortedInAscendingOrder() {
+    public void givenUnsortedArray_whenInsertionSortImperative_thenSortedAsc() {
         int[] input = {6, 2, 3, 4, 5, 1};
         InsertionSort.insertionSortImperative(input);
         int[] expected = {1, 2, 3, 4, 5, 6};
@@ -16,9 +16,8 @@ public class InsertionSortUnitTest {
     }
 
     @Test
-    public void givenUnsortedArray_whenInsertionSortRecursively_thenItIsSortedInAscendingOrder() {
-        // int[] input = {6, 4, 5, 2, 3, 1};
-        int[] input = {6, 4};
+    public void givenUnsortedArray_whenInsertionSortRecursive_thenSortedAsc() {
+        int[] input = {6, 4, 5, 2, 3, 1};
         InsertionSort.insertionSortRecursive(input);
         int[] expected = {1, 2, 3, 4, 5, 6};
         assertArrayEquals("the two arrays are not equal", expected, input);