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