Asymptotic notations part1 [ O, Ω, Θ notations ]

preview_player
Показать описание
This lecture explains O, Ω, Θ notations with explanations
Рекомендации по теме
Комментарии
Автор

Thank You so Much. Your Examples were the clearest to understand in all of Youtube. I hope nothing but success for you my friend!!!

edgargranados
Автор

Kindly correct it at 12:51, while solving the equation.
n >= - 3.3 .

saumitrakaushal
Автор

U luk somewhat similar like Reddy sir, btw ur style of teaching is awesome. Thanku so much sir

AshisRaj
Автор

Sir all your videos are best in you tube

soniasmelodiousland
Автор

Amazing....sir...wow....very nice explanation...

OmitA
Автор

WORK...thankyou sir ..finally found a usefull video on this topic

sharanpreetkaur
Автор

Sir please make videos on more topics ....it's really helpful...clarity of concepts

asishsrivastava
Автор

Can anyone clear my doubt at 12:46?
Is this simplification correct?
I think it should be
-3n <= 10

AdeshPaul
Автор

The example considered to find omega notation with f(n)=5n+10 and g(n)=2n is incorrect according to my opinion because according to the definition of big omega we have to get the value of n0 such that for all n>=n0 we should have f(n)>=cg(n). According to the given question we will never get such value of n0.

ketananand
Автор

I think Ravula and you have an equal level of knowledge, but you express it so much better!

jashanarora
Автор

At 16:00 the value of n0>=0 which will not follow because for a value n0=0.5, square(n)<n. Hence the value of n0>=1

ketananand
Автор

Why are we even learning this in computer science and why we have to prove that f(n) < c.g(n)..! Why? 😯

Prapti.p
Автор

Sir with due respect your both big omega notation examples seem to be wrong. But you explain the concept superbly.

saptarshisanyal
Автор

Sir at 23 i did not understand. Atmost 5n^2 in place of 5n . What is the meaning of this line. Pls elaborate

vishalchauhan
Автор

20:15

I think 0 < c < (1/5)
in order to satisfy f(n) = BigOmega(g(n))

daSurrealist
Автор

5n+10 >= 2n;
3n >= -10;
n >= -3.3;

ankitkulshrestha
Автор

Sir, n^2 >= n is true for n>=1 (not for n>=0) at 15:20

krishnakrmahto
Автор

in last example(f(n)=n^2 g(n)=n^2+5n+100) n>=13 is also satisfy.
why did you take n=20?

munazermontasirakash
Автор

Why are we proving which is not possible in mathematics

divyanshchaudhary
Автор

sir i really wanna ask, how much have you read in your college time???

vasubhatt