Edexcel D1 2014 June — Question 1

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2014
SessionJune
TopicPermutations & Arrangements
TypeAssignment/allocation matching problems

1. \begin{displayquote} McCANN
SMITH
QUAGLIA
CONGDON
EVES
PATEL
BUSH
FOX
OSBORNE
  1. Use a quick sort to produce a list of these names in alphabetical order. You must make your pivots clear.
  2. Use the binary search algorithm on your list to locate the name PATEL. State the number of iterations you use. \end{displayquote} The binary search algorithm is to be used to search for a name in an alphabetical list of 641 names.
  3. Find the maximum number of iterations needed, justifying your answer.