Merge pull request #93 from Diegoslourenco/feature/test-units-python

Add class and unit tests for Selection Sort and Binary Search in Python

Author: larissalages

classical_algorithms/python/BinarySearch.py

@@ -0,0 +1,16 @@
+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

@@ -0,0 +1,16 @@
+class SelectionSort:
+    def sort(self, array):
+        if array is None:
+            raise TypeError('array cannot be None')
+        return self._sort(array)
+
+    def _sort(self, array):
+        if len(array) < 2:
+            return array
+
+        for i in range(len(array)):
+            for j in range(i+1, len(array)):
+                if array[j] < array[i]:
+                    array[i], array[j] = array[j], array[i]
+
+        return array

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()

classical_algorithms/python/tests/test_binary_search.py

@@ -0,0 +1,28 @@
+import unittest
+from classical_algorithms.python.SelectionSort import SelectionSort
+
+class TestSelectionSort(unittest.TestCase):
+    def test_selection_sort(self):
+        selection_sort = SelectionSort()
+
+        print('None Input')
+        self.assertRaises(TypeError, selection_sort.sort, None)
+
+        print('Empty Input')
+        self.assertEqual(selection_sort.sort([]), [])
+
+        print('One Element')
+        self.assertEqual(selection_sort.sort([25]), [25])
+
+        print('Two or More Elements')
+        array = [10, 1, 0, 100, 5, 15, 100, 7]
+        self.assertEqual(selection_sort.sort(array), sorted(array))
+
+        print('Two or More with negative Elements')
+        array = [10, -1, 0, 100, 5, 15, -100, -7]
+        self.assertEqual(selection_sort.sort(array), sorted(array))
+
+        print('Success: selection_sort_sort\n')
+
+if __name__ == '__main__':
+    unittest.main()