1
class Solution:
2
    def search(self, nums: List[int], target: int) -> bool:
3
        nums.sort()
4
        low = 0
5
        high = len(nums) - 1
6
        while low <= high:
7
            mid = (low + high) // 2
8
            if nums[mid] == target:
9
                return True
10
            elif nums[mid] > target:
11
                high = mid - 1
12
            else:
13
                low = mid + 1
14
        return False