OCR A-level Further Mathematics A H245 · 7.03i
Exponential and logarithmic orders of complexity
- Code
- 7.03i
- In
- 7.03 Algorithms
- Topic
- 7 Discrete Mathematics
- Course
- A-level Further Mathematics A H245
- Board
- OCR
Grade boundaries·OCR command words
Codes and titles are read by a script from OCR's published specification and have not been checked by a person. What each point covers is in the specification itself: OCR’s specification.
Points in 7.03 Algorithms
- 7.03a Definition of an algorithm
- 7.03b Awareness of the uses and practical limitations of algorithms
- 7.03c Working with algorithms
- 7.03d The order of an algorithm
- 7.03e Efficiency and complexity
- 7.03f Worst case time complexity
- 7.03g Orders of complexity O(nᵏ)
- 7.03h Best, worst and average case run-times
- 7.03i Exponential and logarithmic orders of complexity
- 7.03j Strategies for sorting
- 7.03k Quick sort
- 7.03l Strategies for packing
- 7.03m Extend their knowledge of packing methods