Assess students' ability to analyze performance trade-offs among QuickSort, MergeSort, and Insertion Sort across varying dataset sizes and input orders (random, sorted, nearly-sorted). Students should explain best/average/worst-case time complexity, space usage, stability, adaptivity, pivot-selection effects, and practical thresholds where one algorithm outperforms another; include brief justification using both theoretical reasoning and simple empirical observations.