Merge pull request #14 from shwetacharde/patch-9

Create Search-in-rotated-sorted-array.java

Search-in-rotated-sorted-array.java

@@ -0,0 +1,30 @@
+class Solution {
+    public int search(int[] arr, int target) {
+        int start=0;
+        int end=arr.length-1;
+
+            while(start<=end){
+                int mid=(start+end)>>1;
+                    if(arr[mid]==target){
+                        return mid;
+                    }
+                    if(arr[start]<=arr[mid]){
+                        if(arr[start]<=target && arr[mid]>=target){
+                            end=mid-1;
+                        }    
+                         else{
+                            start=mid+1;
+                            }
+                        }
+                    else{
+                        if(arr[mid]<=target && target<=arr[end]){
+                            start=mid+1;
+                        }else{
+                            end=mid-1;
+                        }
+                        }   
+                }
+
+       return -1; 
+    }
+}