Fixed binary search

shichao-an · shichao-an · commit 8d36b9a06b8b · 2014-04-24T15:41:56.000-04:00
diff --git a/search_in_rotated_sorted_array/solution.py b/search_in_rotated_sorted_array/solution.py
@@ -12,13 +12,13 @@ def search(self, A, target):
             # Left part is sorted
             if A[mid] > A[right]:
                 if target < A[mid] and target >= A[left]:
-                    right -= 1
+                    right = mid - 1
                 else:
-                    left += 1
+                    left = mid + 1
             # Right part is sorted
             else:
                 if target > A[mid] and target <= A[right]:
-                    left += 1
+                    left = mid + 1
                 else:
-                    right -= 1
+                    right = mid - 1
         return -1
