What you'll learn
How to design and represent algorithms.
Key ideas
- Decomposition and abstraction.
- Flowcharts and pseudocode to represent algorithms.
- Searches: linear and binary; sorts: bubble.
Exam tips
- Remember binary search needs an ordered list.
- Trace algorithms step by step.
Common mistakes
- Using binary search on unsorted data.
- Confusing decomposition and abstraction.