Assess students' ability to analyze and compare time and space trade-offs of insertion sort, merge sort, and quicksort across best/average/worst cases and varied input characteristics (sorted, reverse-sorted, nearly-sorted, random, large). Include Big-O derivations, memory-usage estimates, stability and in-place considerations, pivot-choice effects, and justification for algorithm selection under given constraints. Target: grades 9–12, medium difficulty; emphasis on explanation and comparison.