Skip to content

Course home

Sign up

Computational thinking

EasyMediumHard
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798
Question 72

An analyst is using a linear search algorithm to find an item in an unordered list containing n n\,n elements.

Give the best-case and worst-case scenarios in terms of the number of comparisons required to find the target item.

[2]
Markscheme

Computational thinking Questions

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

Question bank