Assess students' ability to evaluate and choose the most appropriate sorting algorithm (bubble, selection, merge, quick) for grade 6–8 programming tasks. Provide short, scenario-based items that require justification based on time complexity (best/average/worst), memory use (in-place vs extra space), stability, and implementation simplicity. Include tasks such as sorting small lists, nearly-sorted data, memory-constrained devices, and classroom teaching examples; require a recommended algorithm and a concise rationale.