big_o_notation · www.studyline.ai

Study: Big O Notation

Flashcards

1 / 3

🌁 Switch to Slideshow

asymptotic_notation landau_notation mathematical_notation algorithm_analysis computational_complexity complexity_theory asymptotic_bound upper_bound function_class growth_rate dominance_relation preorder

🔥🔥 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(log n) →

🌟 o(n) linear time →