Resolve conflicts and integrate binary search into new structure

Author: 4ndrelim

.idea/workspace.xml

@@ -1,4 +1,4 @@
-package src.algorithms.searches.binarySearch;
+package algorithms.binarySearch;
 
 /** Here, we are implementing BinarySearch where we search an array for a target value at O(log n) time complexity.
  *

src/algorithms/searches/binarySearch/BinarySearch.java renamed to src/main/java/algorithms/binarySearch/BinarySearch.java

@@ -1,4 +1,4 @@
-package src.algorithms.searches.binarySearch;
+package algorithms.binarySearch;
 
 /** Here, we are implementing BinarySearchTemplated where we search an array for a target value at O(log n) time
  * complexity.

src/algorithms/searches/binarySearch/BinarySearchTemplated.java renamed to src/main/java/algorithms/binarySearch/BinarySearchTemplated.java

@@ -6,7 +6,7 @@ upper or lower half of the current search range.
 Two versions of binary search has been implemented in this repository - BinarySearch and BinarySearchTemplated.
 
 ## BinarySearch
-![binary search img](../../../../assets/BinarySearch.png)
+![binary search img](../../../../../assets/BinarySearch.png)
 Image Source: GeeksforGeeks
 
 BinarySearch is a more straightforward and intuitive version of the binary search algorithm. In this approach, after the

src/algorithms/searches/binarySearch/README.md renamed to src/main/java/algorithms/binarySearch/README.md

@@ -1,13 +1,9 @@
-package test.algorithms.binarySearchTest;
+package algorithms.binarySearch;
 
 import org.junit.Test;
 
-import src.algorithms.searches.binarySearch.BinarySearchTemplated;
-import src.algorithms.searches.binarySearch.BinarySearch;
-
 import java.util.Arrays;
 
-import static org.junit.Assert.assertArrayEquals;
 import static org.junit.Assert.assertEquals;
 
 public class BinarySearchTest {