add class BinarySearch.py and test_binary_search.py

Author: Diegoslourenco

classical_algorithms/python/BinarySearch.py

@@ -0,0 +1,18 @@
+import unittest
+
+class BinarySearch:
+    def search(self, array, element):
+        first = 0
+        last = len(array) - 1
+
+        while first <= last:
+            mid = (first + last)//2
+            if array[mid] == element:
+                return mid
+            else:
+                if element < array[mid]:
+                    last = mid - 1
+                else:
+                    first = mid + 1
+        
+        return False

classical_algorithms/python/SelectionSort.py

@@ -9,7 +9,6 @@ def _sort(self, array):
             return array
 
         for i in range(len(array)):
-            minimum = i
             for j in range(i+1, len(array)):
                 if array[j] < array[i]:
                     array[i], array[j] = array[j], array[i]

classical_algorithms/python/tests/__pycache__/BinarySearch.cpython-38.pyc

@@ -0,0 +1,28 @@
+import unittest
+from classical_algorithms.python.BinarySearch import BinarySearch
+
+class TestBinarySearch(unittest.TestCase):
+    def test_binary_search(self):
+        binary_search = BinarySearch()
+
+        print('None Input')
+        self.assertRaises(TypeError, binary_search.search, None)
+
+        print('Empty Input')
+        self.assertEqual(binary_search.search([], 1), False)
+
+        print('One Element')
+        self.assertEqual(binary_search.search([25], 25), 0)
+
+        print('Two or More Elements')
+        array = [0, 10, 15, 100, 150, 200, 203, 230]
+        self.assertEqual(binary_search.search(array, 15), 2)
+
+        print('Two or More with negative Elements')
+        array = [-20, -15, -5, 0, 10, 15, 100, 150, 200, 203, 230]
+        self.assertEqual(binary_search.search(array, -15), 1)
+
+        print('Success: binary_search_search\n')
+
+if __name__ == '__main__':
+    unittest.main()