Resolve conflicts and integrate binary search into new structure

4ndrelim · 4ndrelim · commit 36fe8bda111d · 2023-08-27T16:26:32.000+08:00
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/src/main/java/algorithms/binarySearch/BinarySearch.java b/src/main/java/algorithms/binarySearch/BinarySearch.java
@@ -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.
  *
diff --git a/src/main/java/algorithms/binarySearch/BinarySearchTemplated.java b/src/main/java/algorithms/binarySearch/BinarySearchTemplated.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.
diff --git a/src/main/java/algorithms/binarySearch/README.md b/src/main/java/algorithms/binarySearch/README.md
@@ -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
diff --git a/src/test/java/algorithms/binarySearch/BinarySearchTest.java b/src/test/java/algorithms/binarySearch/BinarySearchTest.java
@@ -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 {

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