Time Complexity Big-Omega Notation

Time Complexity Big-Omega Notation
Watch More Videos at:
Lecture By: Mr. Arnab Chakraborty, Tutorials Point India Private Limited.

[TutorialsPoint_]

Use coupon ""YOUTUBE12"" to get “FLAT 12%’’ OFF at Checkout.

[gutemakoru]

for all those who were confused by f(n) = 5n^2 + 3n +1 when n >= 1 5n^2 + 3n +1 >= 5n^2
he means that the right side of the expression 5n^2
we can write any value of number as long as it is less that the f(n) = 5n^2 + 3n + 1
to meet our cg(n) <= f(n)
hope this helped

[allexirella]

Thank you, i'm ready now for the test I have tommorow! You are great!

[santanudutta]

Please try to explain Sir what is c of g(n). Thanks in advance

[khangdeng]

why did you write constant to be 5, how did it come about?

[amitbarnwal]

Sir apka har example mei Jo aap proof dekhna cha rahay ho WO prove kar de rahay ho but there might be some other example in which big omega notation will not possible

[dhugashetasifna]

please, Assume that f(n)=3n2+2n+3 and g(n)=n2, Show/prove f(n)  (g(n))?

[amitbarnwal]

I want to compare for better understanding.

[jyotsanagaur]

How come only 5n^2 is left. What about 3n n 1