@@ -0,0 +1,895 @@
+Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.%0A%0AYou may assume no duplicates in the array.%0A%0AHere are few examples.%0A%5B1,3,5,6%5D, 5 %E2%86%92 2%0A%5B1,3,5,6%5D, 2 %E2%86%92 1%0A%5B1,3,5,6%5D, 7 %E2%86%92 4%0A%5B1,3,5,6%5D, 0 %E2%86%92 0%0A%0Aclass Solution:%0A    # @param A, a list of integers%0A    # @param target, an integer to be inserted%0A    # @return integer%0A    def searchInsert(self, A, target):%0A        start = 0; end = len(A)-1%0A        if len(A) == 0: return None%0A        %0A        while start%3C len(A) and end %3E= 0 and start %3C= end:%0A            mid = (start+end)/2%0A            if A%5Bmid%5D == target: return mid%0A            elif A%5Bmid%5D %3E target: %0A                    end = mid -1%0A            elif A%5Bmid%5D %3C target:%0A                    start = mid + 1%0A        return start%0A%0A# Note: the while loop condition !%0A# Last the return value is start !%0A

Create Search_Insert_Position.py