Test Grade 9–12 (advanced) students' ability to evaluate and select appropriate sorting algorithms given constraints: time complexity (best/average/worst), space complexity, stability, and input characteristics (nearly-sorted, reverse-sorted, partially-sorted, and memory‑constrained large datasets). Require justified recommendations, complexity analysis, and comparison of algorithms (insertion, quicksort, mergesort, heapsort, Timsort, counting/radix, external sorting).