Your question is Linear Search to Binary Search. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Explain how you would optimize a linear search to run in logarithmic time instead. What assumptions must hold, and how does binary search achieve O(log n)?