Big-Omega
Learn Big-Omega (Complexity, Programming Fundamentals) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.
What is Big-Omega (Ω)? Big-Omega notation describes the lower bound / best case of an algorithm — the minimum amount of work it will ever do for a given input size n . Where Big-O ( O ) asks "how bad can it get?", Big-Omega ( Ω ) asks "how good can it get?" • Written as Ω(f(n)) , e.g. Ω(1) , Ω(n) . • It represents the fastest the algorithm could possibly finish, under the luckiest possible input. • It does NOT mean "average case" — it is strictly the best-case floor.