Your question is Big-O for Sorting and 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).
What are the step-by-step space and time complexity bounds (Big-O) for standard sorting and search structures?