Assess students' ability to evaluate and compare simple search (linear, binary) and sorting (selection, insertion, bubble) methods applied to small lists of names (5–20 items): count comparisons and swaps, reason about relative speed for different list sizes and degrees of pre-sortedness, estimate extra memory needed, and choose the best method for given scenarios with clear, justified trade-offs; use concrete examples and step counts rather than formal notation.