Python Binary Search

binarySearch.py

def search(self, nums, target):
  """
  :type nums: List[int]
  :type target: int
  :rtype: int
  """
  l = 0
  r = len(nums)-1
  while l <= r:
    m = l+(r-l)/2
    if nums[m] == target:
      return m
    if nums[m] < target:
      l = m+1
    else:
      r = m -1
      
  return -1