Cambridge Cambridge IGCSE Computer Science 0265 · 9.3
Algorithm design and evaluation
- Code
- 9.3
- In
- 9 Algorithm design
- Course
- Cambridge IGCSE Computer Science 0265
- Board
- Cambridge
Codes and titles are read by a script from Cambridge's published specification and have not been checked by a person. What each point covers is in the specification itself: Cambridge’s specification.
Points under 9.3
- 9.3.1 Designing and amending algorithms with flowcharts and Python
- 9.3.2 Purpose of an algorithm and its parts
- 9.3.3 Trace tables
- 9.3.4 Finding and correcting algorithm errors
- 9.3.5 Amend an algorithm
- 9.3.6 Linear and binary search on data
- 9.3.7 Bubble, insertion and merge sort on data
- 9.3.8 Coding a linear search and bubble sort
- 9.3.9 Steps of search and sort algorithms
- 9.3.10 Comparing search and sort algorithms
Points in 9 Algorithm design
- 9.1 Abstraction
- 9.2 Decomposition
- 9.3 Algorithm design and evaluation