Skip to main
decomposition Decomposition CYF SDC Curriculum
Open Menu.
Menu
β
Close Menu.
Guides
How computers really work
How this works
Tools
Logic
Decomposition
Legacy code
Complexity
ππΎ Our Programme
ππΏ Join Us
π«ΆπΌ Support Us
Complexity
Sprint 1
π§πΎβπ»
prep
Overview description of the prep work for the sprint
π
back to top
Memory consumption
30 minutes β±
Learning Objectives
Quantify the memory used by different arrays
Memory consumption
Big-O
30 minutes β±
Learning Objectives
Categorise algorithms as O(lg(n)), O(n), O(n^2), O(2^n)
Give practical limits to the size of inputs to O(n^2) and O(2^n) algorithms
Big-O
"Expensive" Operations
30 minutes β±
Learning Objectives
Explain what the significant/expensive operations for a particular algorithm are likely to be
Quantify the number of significant operations taken by a particular algorithm
“Expensive” Operations
Pre-computing
30 minutes β±
Learning Objectives
Identify a pre-computation which will improve the complexity of an algorithm
Pre-computing
← Back
Next →