Searching and sorting algorithms
26
0/4

An analyzer has sorted a list of ten chemical elements alphabetically, as shown in the table below.

Index0123456789
ElementArgonBerylliumCarbonFluorineHeliumLithiumNeonOxygenSodiumXenon

Demonstrate the steps of a binary search algorithm to locate the element Neon in this list. At each stage, you must clearly state:

  • the current lower bound L L\,L and upper bound RRR,
  • the calculation used to determine the midpoint index (using the floor division rule ⌊L+R2⌋\displaystyle \lfloor \frac{L + R}{2} \rfloor⌊2L+R​⌋),
  • the pivot element selected,
  • and the comparison that leads to the next interval.
[4]

Searching and sorting algorithms Questions

Practise OCR GCSE Computer Science Searching and sorting algorithms with exam-style questions for GCSE Computer Science. 36 questions, matched to the OCR GCSE Computer Science (J277) specification and written in Component 01 and Component 02 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.

PreviousNext

Searching and sorting algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /Searching and sorting algorithms