input: Write a python function to search for a value in a list using Binary Search.
  assert search([10, 20, 30, 40, 50], 30) == True
  assert search([10, 20, 30, 40, 50], 60) == False
  assert search([5, 3, 1, 4, 2], 3) == True
  assert search([5, 3, 1, 4, 2], 6) == False
output: def search(lst, target):
      lst.sort()
      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