Your question is Describe How a Sorting Algorithm Works. 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 a sorting algorithm works and discuss its time complexity in common scenarios.
Choose one sorting algorithm and describe its steps, then compare its best-case, average-case, and worst-case time complexity. Also discuss space complexity, stability, and when you would choose it over another sorting algorithm. Keep the explanation language-agnostic, but you may use pseudocode or a short code example.