The PowerPoint below provides an overview of material in this topic, including explanations and examples - for the full experience, open in a new tab then download it. All exercise references are to the new specification Pearson textbook - you can access the digital version for free or buy your own for extra practice.
Written summary notes are also given below for quick revision of key points, plus a selection of exam-style questions (with solutions) to test your understanding.
Click here for topic PPTs or see below for topic videos...
Explore further: Euclidean algorithm
Section 1 Notes - Flow charts and order of an algorithm
Section 2 Notes - Sorting algorithms and bin packing
Sorting algorithm spreadsheet [Note: In this spreadsheet, quick sort uses the first number in the list as the pivot. You should always use the middle number as the pivot in your exams.]
Use the videos below to support your understanding of the topic. The ones on the left are specific to the course, building up to demos of exam-style questions; the ones on the right are for your own amusement, although the alternative outlook may provide you with a deeper overall understanding and appreciation of the topic.
Additional algorithm videos:
Extra fun!
...and now for the mathsy bit: