Your question is Choosing O(n^2) vs O(log n). 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).
In what case would you use an O(n^2) runtime over O(log n)?