Binary search done.

I chose to use an iterative method, instead of recursion, to avoid
function stacks. Perhaps I should try recursive approach and compare the
results.

1 files changed, 31 insertions, 0 deletions

diff --git a/AlgoDesignAndTechniqueEdxJava/tests/BinarySearchTest.java b/AlgoDesignAndTechniqueEdxJava/tests/BinarySearchTest.java
new file mode 100644
index 0000000..59a1289
--- /dev/null
+++ b/AlgoDesignAndTechniqueEdxJava/tests/BinarySearchTest.java
@@ -0,0 +1,31 @@
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.jupiter.api.Test;
+
+class BinarySearchTest {
+
+	@Test
+	void test1() {
+		int[] a = {1, 5, 8, 12, 13};
+		assertEquals(2, BinarySearch.binarySearch(a, 8));
+	}
+
+	@Test
+	void test2() {
+		int[] a = {1, 5, 8, 12, 13};
+		assertEquals(0, BinarySearch.binarySearch(a, 1));
+	}
+
+	@Test
+	void test3() {
+		int[] a = {1, 5, 8, 12, 13};
+		assertEquals(-1, BinarySearch.binarySearch(a, 23));
+	}
+
+	@Test
+	void test4() {
+		int[] a = {1, 5, 8, 12, 13};
+		assertEquals(-1, BinarySearch.binarySearch(a, 11));
+	}
+
+}