Day 3 , search insert position

Solved using while loop and there is one more option of recursion.

Author: sandip1805

day_3_search_insert_position.py

@@ -0,0 +1,13 @@
+class Solution:
+    def searchInsert(self, nums: List[int], target: int) -> int:
+        start = 0
+        end = len(nums) - 1
+        while(start <= end):
+            mid = start + (end-start)//2
+            if(nums[mid] == target):
+                return mid
+            elif(nums[mid] < target):
+                start = mid + 1
+            else:
+                end = mid - 1
+        return start