Easy -1.8 This is a straightforward application of the binary search algorithm requiring only mechanical execution of a well-defined procedure on a simple list. Part (a) involves following steps with no problem-solving, and part (b) uses the standard formula logâ‚‚(26), both being direct recall of taught material with minimal cognitive demand.
2. (a) Starting with a list of all the letters of the alphabet in alphabetical order, demonstrate how a binary search is used to locate the letter P. In each iteration, you must make clear your pivot and the part of the list you are retaining.
(4)
(b) Find the maximum number of iterations needed to locate any particular letter of the alphabet. Justify your answer.
2. (a) Starting with a list of all the letters of the alphabet in alphabetical order, demonstrate how a binary search is used to locate the letter P. In each iteration, you must make clear your pivot and the part of the list you are retaining.\\
(4)\\
(b) Find the maximum number of iterations needed to locate any particular letter of the alphabet. Justify your answer.\\
\hfill \mbox{\textit{Edexcel D1 2013 Q2 [6]}}