Advanced Higher Computing Science Sort and Search Algorithms
This booklet (26 pages) is the first in a series of seven booklets. It teaches students the theory of sort and search algorithms required for the Advanced Higher Computing Science exam.
This booklet covers:
Sort algorithms (bubble, insertion, selection, quick)
Search algorithms (linear and binary)
The booklet includes two exercises of exam style questions to which answers are included as a separate file.
This booklet was written for the Scottish Advanced Higher Computer Science course but could be used as part of any advanced programming course covering these sort and search algorithms
Booklets 2 to 7 are currently being written to cover the complete exam syllabus and will be made available in the next few weeks.