Algorithms
What an algorithm is, flowcharts, pseudocode and trace tables, then the standard searches and sorts, heard on the robot's buzzer and compared for speed.
Start in the simulator- F5.1 What an algorithm is Inputs, processes and outputs; what makes an algorithm precise; programs implement algorithms.
- F5.2 Flowcharts The standard symbols, and turning a flowchart into code.
- F5.3 Pseudocode and the exam reference language Reading and writing your board's pseudocode, and translating it into Python.
- F5.4 Trace tables Following an algorithm line by line, and tracing to find a logic error.
- F5.5 Linear search Checking every item: finding a marker in the robot's sightings.
- F5.6 Binary search Halving a sorted list, and why it needs sorted data.
- F5.7 Bubble sort Passes and swaps, stopping early, and hearing a tune become a scale.
- F5.8 Insertion sort Building a sorted part one item at a time, on the robot's readings.
- F5.9 Merge sort and comparing algorithms Splitting and merging, and choosing between the searches and sorts.
- F5.10 Project: sort the readings Survey the room, sort the records, answer questions from sorted data, and choose the algorithms.