Function binary_search

Search Algorithms/binary_search.py:1–13

(self, nums: List[int], target: int)

  def binary_search(self, nums: List[int], target: int) -> int:

      low = 0
      high = len(nums)-1
      while low <= high:    
          mid = (low + high) // 2
          if nums[mid] ==  target:
              return mid
          elif nums[mid] < target :
              low = mid + 1
          else:
              high = mid - 1
      return -1