2.1
Algorithms
Flowcharts, pseudocode, searching and sorting
Algorithm: Step-by-step solution to a problem
Flowcharts use shapes: oval (start/end), rectangle (process), diamond (decision)
Linear search: Check each item, works on unsorted data
Binary search: Halve search space, requires sorted data
Bubble sort: Compare adjacent pairs, swap if needed
Merge sort: Divide, sort halves, merge together
Exam Tips
- •Always define key terms before explaining concepts
- •Use specific examples where possible to demonstrate understanding
- •Check mark allocation - one point per mark is a good guide