Assess students' ability to analyze and compare time and space complexity and practical trade-offs of insertion sort, merge sort, quicksort, and heapsort across different input distributions (random, sorted, reverse-sorted, nearly-sorted, many duplicates). Tasks: state best/average/worst-case complexities, discuss stability and in-place behavior, memory use and recursion depth, consider pivot choice and constant factors, and justify algorithm selection for specific scenarios.