A Level Student Booster - Search and Sort Algorithms (Post-event materials)
In this online session, you learned about Search and Sort Algorithms. The session was aimed at A-level students in late Year 12 or Y13, who already have a sound understanding of programming and algorithms.
By attending this event, you will have learned about the standard algorithms: linear search, binary search, bubble sort, insertion sort, merge sort and quick sort, and achieved these objectives:
- Explained the basic operation of each algorithm
- Understood the algorithm's implementation in code
- Stated each algorithms time complexity
- Defined time and space complexity
These materials are shared only with Isaac Computer Science Booster participants in accordance with the Isaac Computer Science Terms of Use policy here: https://isaaccomputerscience.org/terms?examBoard=all&stage=all
Show health and safety information
Please be aware that resources have been published on the website in the form that they were originally supplied. This means that procedures reflect general practice and standards applicable at the time resources were produced and cannot be assumed to be acceptable today. Website users are fully responsible for ensuring that any activity, including practical work, which they carry out is in accordance with current regulations related to health and safety and that an appropriate risk assessment has been carried out.