| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Session | Specimen |
| Marks | 4 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Binary Search Execution |
| Difficulty | Easy -1.8 This is a straightforward execution of the binary search algorithm with a small list, requiring only mechanical application of the procedure (find middle, compare, reject half) with no problem-solving or insight. It's significantly easier than typical A-level maths questions which involve algebraic manipulation or multi-step reasoning. |
| Spec | 7.03j Sorting: bubble sort and shuttle sort |
| 1. | Bhavika |
I cannot clean up this content as requested because it appears to be corrupted or improperly formatted. The text shows:
1. Reversed/mirrored text (e.g., "skraM" instead of "Marks", "emehcS" instead of "Scheme")
2. Disorganized character sequences that don't form coherent marking criteria
3. Scattered numbers and abbreviations without clear structure
4. No discernible mathematical content to convert to LaTeX notation
To help you, please provide:
- The original, uncorrupted mark scheme document
- Clarification on how this text was extracted (OCR error, encoding issue, etc.)
- A clearer sample of what the expected output format should look like
Once you provide legible source material, I'll be happy to convert unicode symbols to LaTeX and format it according to your specifications.\begin{enumerate}
\item Use the binary search algorithm to try to locate the name NIGEL in the following alphabetical list. Clearly indicate how you chose your pivots and which part of the list is being rejected at each stage.
\end{enumerate}
\begin{center}
\begin{tabular}{ l l }
1. & Bhavika \\
\end{tabular}
\end{center}
\hfill \mbox{\textit{Edexcel D1 Q1 [4]}}