Assess students' ability to describe and simulate linear and binary search on sorted lists: explain the step-by-step process of each method, count and compare the number of element comparisons on small example lists, state best/average/worst-case behavior in intuitive terms, and justify which search is more efficient for different list sizes and conditions (e.g., sorted vs unsorted, presence of random access). Keep explanations age-appropriate and focus on conceptual growth (linear vs logarithmic) rather than formal proofs.