[Assess students' understanding of simple step-by-step algorithms used to sort and search lists. Tasks include tracing basic sorts (e.g., bubble or selection) and linear search on small number or word lists, explaining each step and final result, predicting outcomes after given steps, comparing simple step counts (effort), and identifying or correcting errors in algorithm steps. Suitable for Grade 3–5 foundational computational thinking.]