Assess students' ability to analyze time complexities (best/average/worst), space usage, stability, and in-place behavior of quicksort, mergesort, heapsort, and insertion sort; include tasks that require comparing trade-offs, identifying worst-case inputs and mitigations (e.g., pivot choice, stable variants), calculating memory overhead, and selecting the most appropriate algorithm for specific data patterns and constraints.