Study
Focus:
⚑ Flashcards 🌁 Slideshow

Big O Notation

Flashcards
1 / 3
asymptotic_notation landau_notation mathematical_notation algorithm_analysis computational_complexity complexity_theory asymptotic_bound upper_bound function_class growth_rate dominance_relation preorder
πŸ’¬ Click on the content to Ask AI
Explore More
πŸ”₯πŸ”₯ landau notation β†’ Landau notation extends Big O by generalizing asymptotic analysis to a full suite of symbols (O, Θ, Ξ©, o, Ο‰), adding tight and lower bounds and stricter small-o/omega relations; fluency with Big O's dominant-term, scale-focused reasoning underpins these definitions.
πŸ”₯ space complexity β†’ Space complexity is expressed using Big O notation to state how an algorithm's memory usage scales with input size; it depends on Big O to formalize asymptotic space bounds and compare algorithms while ignoring constant factors.
πŸ”₯ time complexity β†’ Time complexity is expressed and compared using Big O; the notation provides asymptotic bounds that formalize how running time grows, making standardized analysis possible.
🌟 o(1) β†’
🌟 o(log n) β†’
🌟 o(n) linear time β†’