Sorting is one of the most expensive operations you can do and you’d have to operate on all of the elements before you could search your sorted array.
It would be better to hash the elements (using a set in Python) and do a membership search in a single run through.
The worst-case search time the hash and check method is ~O(N/2) and it will work on any data type that can be coerced to a string.