Your question is Compare Common Sorting Algorithm Complexities. 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).
Discuss the time and space complexities of common sorting algorithms such as bubble sort, insertion sort, merge sort, quicksort, and heap sort. Compare their best, average, and worst cases, and explain when you would choose one over another.