solves search in rotated sorted array

Author: anishLearnsToCode

Diff for: README.md

@@ -37,6 +37,7 @@
 |  28  | [Needle in Haystack](https://leetcode.com/problems/implement-strstr)                                                                                      |                                  [![Java](assets/java.png)](src/NeedleInHaystack.java) [![Python](assets/python.png)](python/needle_in_haystack.py)                                  |                                                                                                                                   |
 |  29  | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers)                                                                                  |                                                                [![Java](assets/java.png)](src/DivideTwoIntegers.java)                                                                |                                                                                                                                   |
 |  31  | [Next Permutation](https://leetcode.com/problems/next-permutation)                                                                                        |                                                                 [![Java](assets/java.png)](src/NextPermutation.java)                                                                 |                                                                                                                                   |
+|  33  | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array)                                                            |                                                           [![Java](assets/java.png)](src/SearchInRotatedSortedArray.java)                                                            |                                                                                                                                   |
 |  35  | [Search Inserted Position](https://leetcode.com/problems/search-insert-position/)                                                                         |                              [![Java](assets/java.png)](src/SearchInsertPosition.java) [![Python](assets/python.png)](python/search_insert_position.py)                              |                                                                                                                                   |
 |  38  | [Count and Say](https://leetcode.com/problems/count-and-say)                                                                                              |                                       [![Java](assets/java.png)](src/CountAndSay.java) [![Python](assets/python.png)](python/count_and_say.py)                                       |                                                                                                                                   |
 |  53  | [Maximum SubArray](https://leetcode.com/problems/maximum-subarray)                                                                                        |                                 [![Java](assets/java.png)](src/MaximumSubArray.java) [![Python](assets/python.png)](python/maximum_sum_subarray.py)                                  |                                                                                                                                   |

Diff for: src/SearchInRotatedSortedArray.java

@@ -0,0 +1,28 @@
+// https://leetcode.com/problems/search-in-rotated-sorted-array
+// T: O(logN)
+// SL O(1)
+
+public class SearchInRotatedSortedArray {
+    int search(int[] array, int target) {
+        final int shift = minElementIndex(array);
+        int left = 0, right = array.length - 1, middle, realMiddle;
+        while (left <= right) {
+            middle = (left + right) / 2;
+            realMiddle = (middle + shift) % array.length;
+            if(array[realMiddle] == target) return realMiddle;
+            if(array[realMiddle] < target) left = middle + 1;
+            else right = middle - 1;
+        }
+        return -1;
+    }
+
+    private int minElementIndex(int[] array) {
+        int left = 0, right = array.length - 1, middle;
+        while(left < right){
+            middle = (left + right) / 2;
+            if(array[middle] > array[right]) left = middle + 1;
+            else right = middle;
+        }
+        return left;
+    }
+}