Search In Rotated Sorted Array

Author: TonyKim9401

search-in-rotated-sorted-array/TonyKim9401.java

@@ -0,0 +1,25 @@
+// TC: O(log n)
+// -> binary search
+// SC: O(1)
+class Solution {
+    public int search(int[] nums, int target) {
+
+        int start = 0;
+        int end = nums.length - 1;
+
+        while (start <= end) {
+            int mid = start + (end - start) / 2;
+
+            if (nums[mid] == target) return mid;
+
+            if (nums[start] <= nums[mid]) {
+                if (nums[start] <= target && target < nums[mid]) end = mid - 1;
+                else start = mid + 1;
+            } else {
+                if (nums[mid] < target && target <= nums[end]) start = mid + 1;
+                else end = mid - 1;
+            }
+        }
+        return -1;
+    }
+}