Assess students' ability to apply binary search and the sorting algorithms insertion, merge, and quick to array-based problems: implement or trace each algorithm on small arrays, choose the most appropriate method for given input sizes and constraints, analyze time/space complexity and stability, state and justify binary-search preconditions and edge-case behavior, and propose hybrid strategies (e.g., use insertion on small partitions).