Assess students' ability to analyze and compare step-by-step algorithms for sorting and searching small sets (3–7 items) using tasks such as arranging colored blocks or finding a name in a list. Students will trace simple methods (e.g., single-pass swaps, selection steps, linear search), count comparisons or swaps, identify errors, predict outputs, and justify which method is more efficient or reliable for the given set.