Assess students' ability to analyze trade-offs among QuickSort, MergeSort, and HeapSort: compare average and worst-case time complexity, auxiliary space, stability, and practical performance factors (cache locality, recursion/constant overhead, and input patterns). Include short scenarios where learners must choose the most appropriate algorithm for given constraints and justify their choice with respect to complexity, memory use, stability needs, and real-world behavior.