Your question is Sorting Algorithm Complexity Comparison. 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 time complexities of common sorting algorithms such as bubble sort, insertion sort, merge sort, quicksort, and heapsort? Also explain their typical space usage and when one is preferred over another.