🚀 Initialized Project: Completed Exercise

Author: dev-xero

binary_search.py

@@ -0,0 +1,19 @@
+def binary_search(r_list: list, req: int):
+    lo = 0
+    hi = len(r_list) - 1
+
+    while lo <= hi:
+        mid = (lo + hi) // 2
+        print(r_list[lo: hi + 1])
+        if r_list[mid] == req:
+            return r_list[mid]
+        elif r_list[mid] < req:
+            lo = mid + 1
+        else:
+            hi = mid - 1
+
+    return None
+
+
+n_list = [-1, 0, 1, 3, 4, 4, 10]
+print(binary_search(n_list, -1))

selection_sort.py

@@ -0,0 +1,18 @@
+# The time complexity of this algorithm is O(n²)
+def selection_sort(u_list: list):
+    new_list = []
+    # this function runs n times taking O(n) time
+    for k in range(len(u_list)):
+        # Return the smallest item in the array
+        # This operation takes O(n) time
+        i = 0
+        for j in range(1, len(u_list)):
+            if u_list[j] < u_list[i]:
+                i = j
+
+        new_list.append(u_list.pop(i))
+
+    return new_list
+
+
+print(f'sorted list: {selection_sort([0, -1, 4, 3, 4, 10, 1])}')