1.
| Hajra | | \(( \mathrm { H } )\) |
| | Vicky | | \(( \mathrm { V } )\) |
| | Leisham | | \(( \mathrm { L } )\) |
| | Alice | | \(( \mathrm { A } )\) |
| | Nicky | | \(( \mathrm { N } )\) |
| | June | | \(( \mathrm { J } )\) |
| | Sharon | | \(( \mathrm { S } )\) |
| | | Paul | | \(( \mathrm { P } )\) |
|
The table shows the names of nine people.
- Use a quick sort to produce the list of names in ascending alphabetical order.
You must make your pivots clear.
- Use the binary search algorithm on your list to locate the name Paul.