Added python Cdoe for search in sorted and rotated array and added de... (#12)

* Added python Cdoe for search in sorted and rotated array and added details to contribution

* Added solution for search in a sorted and rotated array

Author: sachinnegi

Python/search-in-rotated-sorted-array.py

@@ -0,0 +1,35 @@
+"""
+Time Complexity: O(logn)
+Space Complexity: O(1)
+
+Point to observe: Each time either the left half will be sorted or the right half.
+Hence Binary Search is a good option.
+"""
+
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        n = len(nums)
+        low  = 0
+        high = n-1
+        while low<=high:
+            mid = (low+high)//2
+            if nums[mid]==target:
+                return mid
+            
+            # if left half is sorted 
+            if nums[low]<=nums[mid]:
+                if nums[low]<=target<nums[mid]:
+                    high = mid-1
+                else:
+                    low = mid+1
+                    
+            # if right half is sorted
+            else:
+                if nums[mid]<target<=nums[high]:
+                    low = mid+1
+                else:
+                    high = mid-1
+        return -1
+                    
+            
+        

README.md

@@ -152,6 +152,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | #   | Title                                                                 | Solution                                                             | Time      | Space     | Difficulty | Tag | Note                   |
 | --- | --------------------------------------------------------------------- | -------------------------------------------------------------------- | --------- | --------- | ---------- | --- | ---------------------- |
 | 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | [Java](./Java/May-LeetCoding-Challenge/Day-1-First-Bad-Version.java) <br> [JavaScript](./JavaScript/First-Bad-Version.js)                      | _O(logn)_ | _O(1)_    | Easy       |     | Binary Search          |
+| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Python](./Python/search-in-rotated-sorted-array.py)                     					       | _O(logn)_ | _O(1)_    | Medium     |     | Binary Search          |
 
 <br/>
 <div align="right">
@@ -185,7 +186,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | [Lokendra Bohra](https://github.com/lokendra1704/) <br> <img src="https://github.com/lokendra1704.png" width="100" height="100">     | India   | Python               | [Leetcode](https://t.co/u0OByxhcHA) <br> [Hackerrank](https://www.hackerrank.com/lokendra17)                                                                 |
 | [Yuri Spiridonov](https://github.com/YuriSpiridonov) <br> <img src="https://github.com/YuriSpiridonov.png" width="100" height="100"> | Russia  | Python               | [Twitter](https://twitter.com/YuriSpiridonov)<br>[Leetcode](https://leetcode.com/yurispiridonov/)<br>[Hackerrank](https://www.hackerrank.com/YuriSpiridonov) |
 | [Naveen Kashyap](https://github.com/naveenkash) <br> <img src="https://github.com/naveenkash.png" width="100" height="100">          | India   | Javascript           | [Twitter](https://twitter.com/naveen_kashyapp)<br>[Leetcode](https://leetcode.com/naveenkash/)                                                               |
-
+| [Sachin Singh Negi](https://github.com/sachinnegi) <br> <img src="https://github.com/sachinnegi.png" width="100" height="100">       | India   | Python           	| [Twitter](https://twitter.com/SachinSinghNe17)<br>[Leetcode](https://leetcode.com/negisachin688/)<br>[Hackerrrak](https://www.hackerrank.com/negisachin688)  |                                                             |
 <br/>
 <div align="right">
     <b><a href="#algorithms">⬆️ Back to Top</a></b>