Linear and binary search algorithms are the focus of this Grade 10 Computer Science worksheet on algorithms and computational thinking. Students trace how each search method works, compare their efficiency, and decide which algorithm is appropriate based on factors such as sorted order, dataset size, and the position of a target value.

Compare two essential searching strategies

Students examine linear search as a method that checks elements one at a time from the beginning of a list. They contrast this with binary search, which requires sorted data and repeatedly compares the target with the midpoint of the current search interval. The lesson emphasizes how binary search narrows the possible range after each comparison and why using it on an unsorted list can produce incorrect results.

The worksheet also develops reasoning about algorithm trade-offs. Learners consider when linear search is a safer choice, when binary search is likely to require fewer comparisons, and why a large sorted array makes binary search especially useful. They work with midpoint positions, interval bounds, left and right halves, exact matches, and unsuccessful searches.

How students show their thinking

Practice includes a dialogue, matching activity, cloze passage, diagram labeling, reading passage, multiple-choice questions, true-or-false statements, short-answer questions, and an extended response. These tasks move from identifying key vocabulary to tracing search behavior and justifying an algorithm choice.

The extended response asks students to choose between linear and binary search for a large dataset that is already sorted and support their decision with details about how the selected algorithm behaves. This gives students a direct opportunity to explain efficiency rather than simply recall definitions.

Included for teaching support

• Student worksheet covering linear search, binary search, midpoint comparisons, sorted data, and search intervals
• Separate Teacher Guide PDF with learning objectives, teaching tips, discussion questions, and common mistakes

Ways to use it in class

Use this searching algorithms worksheet when introducing algorithm efficiency, reinforcing computational thinking, or reviewing linear search versus binary search before students move into programming implementations. It can support teacher-led instruction, guided practice, independent work, or follow-up discussion.

The resource keeps the comparison grounded in actual search behavior: linear search advances one position at a time, while binary search uses sorted order to eliminate part of the remaining interval. That contrast helps students connect algorithm choice with assumptions about the data instead of treating the two methods as interchangeable procedures.