Assess students' ability to analyze and compare time and space complexity using Big-O notation for insertion sort, merge sort, and binary search: identify best/average/worst-case time complexities, derive complexities from brief pseudocode snippets, explain auxiliary vs. in‑place space usage, and justify trade-offs and practical implications for different input sizes and data characteristics; suitable for grade 9-12, medium difficulty, focus on analytical reasoning and justification.