This document discusses Big O notation, which is used to describe the time and space complexity of algorithms. It explains that Big O notation provides upper bounds for runtime that ignore constants and lower-order terms. Common time complexities like O(n), O(n^2), O(log n) are introduced. Properties like addition and multiplication rules for Big O are covered. The document also discusses how constant factors can affect complexity, and introduces the concept of amortized complexity analysis.
This document discusses Big O notation, which is used to describe the time and space complexity of algorithms. It explains that Big O notation provides upper bounds for runtime that ignore constants and lower-order terms. Common time complexities like O(n), O(n^2), O(log n) are introduced. Properties like addition and multiplication rules for Big O are covered. The document also discusses how constant factors can affect complexity, and introduces the concept of amortized complexity analysis.
This document discusses Big O notation, which is used to describe the time and space complexity of algorithms. It explains that Big O notation provides upper bounds for runtime that ignore constants and lower-order terms. Common time complexities like O(n), O(n^2), O(log n) are introduced. Properties like addition and multiplication rules for Big O are covered. The document also discusses how constant factors can affect complexity, and introduces the concept of amortized complexity analysis.
This document discusses Big O notation, which is used to describe the time and space complexity of algorithms. It explains that Big O notation provides upper bounds for runtime that ignore constants and lower-order terms. Common time complexities like O(n), O(n^2), O(log n) are introduced. Properties like addition and multiplication rules for Big O are covered. The document also discusses how constant factors can affect complexity, and introduces the concept of amortized complexity analysis.
