───✱*.｡:｡✱*.:｡✧*.｡✰*.:｡✧*.｡:｡*.｡✱ ───
Order of complexity (or Big-O notation) describes how the runtime of an algorithm or function grows relative to the input size , especially as . It provides an upper bound on complexity and typically focuses on the worst-case scenario.
Big-O in Equations
- In an equation, the most significant term is the most important term, since it effects the of the function the most as .
- For instance for , it would be
Cheat Sheet
───✱*.｡:｡✱*.:｡✧*.｡✰*.:｡✧*.｡:｡*.｡✱ ───