Binary Search

Log

Loading List & Target | Adding Left and Right Pointers...

Code

class Solution:
    def search(self, nums, target):
        s = 0
        e = len(nums) - 1
        while (s <= e):
            mid = (s+e) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] < target:
                s = mid + 1
            else:
                e = mid - 1
        return -1