Big O Notation
A mathematical notation that describes the performance or complexity of an algorithm, providing an upper bound on the number of operations required as a function of input size.
Areas of application
- computer science
- software engineering
- algorithm analysis
- performance optimization
- data structure analysis
Example
An algorithm that has a time complexity of O(n^2) will take longer to complete for larger inputs.