Below are revision links to various resources that will help you to revise for Unit 2.3 - Algorithms. Further below are the exam questions we have done in lesson with the mark scheme and worked answer. You will study the use of algorithms to describe problems and standard algorithms.
You need to know:
Analysis and design of algorithms for a given situation.
Standard algorithms (bubble sort, insertion sort, binary search and linear search).
Implement bubble sort, insertion sort.
Implement binary and linear search.
Representing, adding data to and removing data from queues and stacks.
Compare the suitability of different algorithms for a given task and data set.
Quizlet have made online flashcards for you! Use this to make your own flashcards or learn from Quizlet's flashcards... your own ones maybe better suited for you though...
Physics and Math's tutor is a great tool for finding mock papers with the mark scheme and have recently made notes for revision. This link is a great tool for checking any gaps in knowledge you might have and will fill those gaps. Great to use for making flash cards too! The link will also display everything else the site has to offer for revision.
A lot of us struggle with knowing the difference between each sorting algorithm, but Isaac computing offers one of the most in-depth and easy to comprehend notes. It goes into detail each of the sorting algorithms and offers examples and worked answers.
I'll admit, their videos can get very monotone but that's not the point of these videos. Craig and Dave do an amazing job in explaining the content in good depth and highlight what you need to know for your exams and development. The link will display all you need to know for the sub-unit.