Find in Ordered Set (Practice Interview Question)

Suppose we had a list of n integers sorted in ascending order. How quickly could we check if a given integer is in the list?

Because the list is sorted, we can use binary search to find the item in time and additional space.