Minor updates

search-and-sort/binary-search.py

@@ -1,24 +0,0 @@
-# Binary search for the target in a sorted array, assume the array has no dups
-# Time complexity: O(logn)
-# Space complexity: O(1)
-
-import pytest
-
-def test_binary_search():
-    case1 = [0,1,2,3]
-    assert binary_search(case1,1) == 1
-    assert binary_search(case1,0) == 0
-    assert binary_search(case1, 0.5) == -1
-
-def binary_search(l, target):
-    left = 0
-    right = len(l)-1
-    while right >= left:
-        m = (right - left )//2
-        if l[m] == target:
-            return m
-        if target < l[m]:
-            right = m - 1
-        else:
-            left = m + 1
-    return -1

search-and-sort/binary_search.py

@@ -1,3 +1,4 @@
+# Binary search for the target in a sorted array, assume the array has no dups
 # Time complexity: O(logn)
 # Space complexity: O(1)
 
@@ -6,18 +7,18 @@ import pytest
 def test_binary_search():
     case1 = [0,1,2,3]
     assert binary_search(case1,1) == 1
+    assert binary_search(case1,0) == 0
+    assert binary_search(case1, 0.5) == -1
 
 def binary_search(l, target):
     left = 0
     right = len(l)-1
-
-    while right > left:
+    while right >= left:
         m = (right - left )//2
-        print(m)
         if l[m] == target:
             return m
-        elif target < l[m]:
+        if target < l[m]:
             right = m - 1
         else:
             left = m + 1
-    return 0
+    return -1

search-and-sort/quick_sort.py

@@ -1,6 +1,6 @@
 # Quick sort
 # The idea is to pick a pivot point and sort the array such that
-# the left part of the coverging point is smaller than the pivor point,
+# the left part of the coverging point is smaller than the pivot point,
 # the right larger.
 # converging point is found when the right pointer is smaller than the left pointer
 import pytest