🔗
Big O Notation
★★★☆☆High School
📖Definition
Asymptotic notation to express time/space complexity of algorithms.
📐Formulas
f(n) = O(g(n))
f is upper-bounded by g (worst case)
O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(2ⁿ)
Common complexity ordering
✏️Examples
예제 1★★☆☆☆
Time complexity of bubble sort?
예제 2★★☆☆☆
Time complexity of binary search?
⚡Applications
Algorithm Analysis
Efficiency comparison
System Design
Scalability assessment
🔗Related Documents
→Prerequisites
←Next Topics
↔Related
#빅오#복잡도#Big O#complexity