diff --git a/src/main/java/algorithms/binarySearch/binarySearchTemplated/README.md b/src/main/java/algorithms/binarySearch/binarySearchTemplated/README.md
index 1a293c2..d64a938 100644
--- a/src/main/java/algorithms/binarySearch/binarySearchTemplated/README.md
+++ b/src/main/java/algorithms/binarySearch/binarySearchTemplated/README.md
@@ -83,7 +83,7 @@ Due to the nature of floor division in Java's \ operator, if there are two mid-v
 when the number of elements is even, the first mid-value will be selected. Suppose we do not increment the low pointer
 during reassignment, `low = mid`, let us take a look at the following example:
 
-![binary search templated 1 img](../../../../../docs/assets/images/BinarySearchTemplated3.jpeg)
+![binary search templated 1 img](../../../../../../docs/assets/images/BinarySearchTemplated3.jpeg)
 
 The search space has been narrowed down to the range of index 1 (low) to 2 (high). The mid-value is calculated,
 `mid = (1 + 2) / 2`, to be 1 due to floor division. Since `2 < 5`, we enter the else block where there is reassignment
diff --git a/src/test/java/algorithms/binarySearch/BinarySearchTest.java b/src/test/java/algorithms/binarySearch/BinarySearchTest.java
index 15e418c..64a1228 100644
--- a/src/test/java/algorithms/binarySearch/BinarySearchTest.java
+++ b/src/test/java/algorithms/binarySearch/BinarySearchTest.java
@@ -1,10 +1,11 @@
 package algorithms.binarySearch;
 
-import algorithms.binarySearch.binarySearch.BinarySearch;
-import algorithms.binarySearch.binarySearchTemplated.BinarySearchTemplated;
+import static org.junit.Assert.assertEquals;
+
 import org.junit.Test;
 
-import static org.junit.Assert.assertEquals;
+import algorithms.binarySearch.binarySearch.BinarySearch;
+import algorithms.binarySearch.binarySearchTemplated.BinarySearchTemplated;
 
 public class BinarySearchTest {
     @Test