Assess students' ability to analyze and compare linear and binary search on sorted lists. Tasks will include tracing each algorithm on short example lists, counting comparisons and steps, identifying best/average/worst‑case behavior, explaining why binary search requires sorted data, and justifying which method is more efficient for given list sizes and scenarios. Include short explanations in plain language appropriate for grades 6–8.