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