Test learners' ability to analyze and compare time and space trade-offs among quicksort, mergesort, heapsort, and insertion sort. Cover average-case and worst-case time complexities, auxiliary space usage, stability, in-place vs out-of-place implementations, and practical performance across input patterns (random, nearly sorted, reversed) and sizes. Include complexity calculations, effects of pivot/heap choices and recursion depth, and short justification tasks asking students to select the most appropriate algorithm for given scenarios.