input: Write a python function to search for an item in a sorted list using binary search.
  assert search([2, 3, 4, 5, 8, 9, 10], 8) == True
  assert search([2, 3, 4, 5, 8, 9, 10], 6) == False
  assert search([1, 3, 5, 7, 9], 3) == True
  assert search([1, 3, 5, 7, 9], 2) == False
output: def search(arr, target):
      left, right = 0, len(arr) - 1
      
      while left <= right:
          mid = (left + right) // 2
          if arr[mid] == target:
              return True
          elif arr[mid] < target:
              left = mid + 1
          else:
              right = mid - 1
      
      return False