Added searching and sorting

Author: das-jishu

Searching-and-sorting/binary-search.py

@@ -0,0 +1,39 @@
+
+def binary_search_iter(arr, target):
+    left, right = 0, len(arr) - 1
+
+    while left < right:
+        mid = (left + right) // 2
+        if arr[mid] == target:
+            return True
+        elif arr[mid] > target:
+            right = mid - 1
+        else:
+            left = mid + 1
+
+    return False
+
+def binary_search_rec(arr, target):
+    left, right = 0, len(arr)
+    if len(arr) < 1:
+        return False
+
+    mid = (left + right) // 2
+    if arr[mid] == target:
+        return True
+    elif target < arr[mid]:
+        binary_search_rec(arr[:mid], target)
+    else:
+        binary_search_rec(arr[mid + 1:], target)
+
+    return False
+
+
+if __name__ == "__main__":
+    print(binary_search_iter([1, 2, 3, 4, 5, 6], 5))
+    print(binary_search_iter([1, 2, 5, 6], 8))
+    print(binary_search_rec([1, 2, 5, 6], 3))
+    print(binary_search_rec([1, 2, 5, 6], 5))
+    
+    
+    

Searching-and-sorting/bubble-sort.py

@@ -0,0 +1,18 @@
+
+def bubble_sort(arr):
+
+    for i in range(len(arr) - 1):
+        for j in range(len(arr) - i - 1):
+            if arr[j] > arr[j + 1]:
+                t = arr[j]
+                arr[j] = arr[j + 1]
+                arr[j + 1] = t
+
+
+if __name__ == "__main__":
+    arr = [3, 6, 2, 5, 0, 5, 2, 9, 7]
+    arr2 = [3, 1]
+    bubble_sort(arr)
+    print(arr)
+    bubble_sort(arr2)
+    print(arr2)

Searching-and-sorting/selection-sort.py

@@ -0,0 +1,20 @@
+
+def selection_sort(arr):
+
+    for i in range(len(arr)):
+        pos = i
+        for j in range(i + 1, len(arr)):
+            if arr[j] < arr[pos]:
+                pos = j
+        t = arr[pos]
+        arr[pos] = arr[i]
+        arr[i] = t
+
+if __name__ == "__main__":
+    arr = [2, 6, 4, 6, 7, 1, 0]
+    arr2 = [3, 1]
+    selection_sort(arr)
+    selection_sort(arr2)
+    print(arr)
+    print(arr2)
+