Assess students' ability to choose and justify appropriate sorting algorithms for varied dataset characteristics—size, presortedness, key distribution, duplicate frequency, and memory constraints. Include tasks to identify suitable algorithms (e.g., insertion, quicksort, mergesort, heapsort, counting/radix, external sorts), predict time/space complexity and stability, and explain trade-offs and optimizations for short real-world scenarios requiring algorithm selection and justification.