Your question is Sorting Algorithm Time Complexity. 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 complexity of common sorting algorithms.
Explain the best-case, average-case, and worst-case time complexity of bubble sort, insertion sort, selection sort, merge sort, quicksort, and heap sort. State the auxiliary space complexity, whether each algorithm is stable and in-place, and identify the assumptions behind the analysis. Include concise Python implementations or pseudocode for at least two algorithms and explain how input ordering affects performance.