Test students' ability to apply sorting algorithms and binary search within a block-based programming environment (e.g., Scratch/Blockly). Assess converting algorithms into block code, preparing and verifying sorted lists, tracing block execution on sample datasets, debugging for correctness, and comparing efficiency by counting steps/comparisons and describing intuitive time complexity. Scope: implement at least one sorting method (e.g., insertion, selection, or merge), perform binary search on the sorted list, and propose simple optimizations for list processing.