Big-O Notation
noun
say it: “BIG OH noh-TAY-shun” /bɪɡ oʊ noʊˈteɪʃən/
A short way of writing how the work a piece of code does grows as its data grows, such as O(n) or O(n²).
What is Big-O Notation?
Big-O Notation refers to how complex code is.
There are 2 parts that make up Big-O complexity.
- How long it takes code to execute
- How much storage space is required for the process (or calculation)
In a sentence
- “In the interview I said my search was O(n) in Big-O notation, because twice the data means twice the reading.”
Level: Journeyman · More OOP terms at this level
Updated