Skip to content

Course home

Sign up

Computational thinking

EasyMediumHard
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
Question 76

A binary search algorithm is highly efficient but requires the data to be sorted beforehand.

Describe how a binary search algorithm operates to find a target value within a sorted list of items.

[4]
Markscheme

Computational thinking Questions

  1. GCSE
  2. /Computer Science
  3. /Computational thinking

Question bank