Комментарии:
Nice video! I have got a similar Big O video (10 minutes long) which teaches you everything you need for your technical interview.
ОтветитьThat last one got me too.
ОтветитьGreat video! I was hoping to see O(logn) :)
Ответитьlast example is quite tricky
Ответитьyou look tired and depressed
ОтветитьVery good explanation on application of BigO to real examples. Liked and subscribed!
ОтветитьI got more out of this than my last two class sessions of my teacher trying to explain it. THANK YOU
ОтветитьU r not having indices rather content on those indices, u r keep saying using indices / index...
Ответить“the time complexity is based on whether or not the algorithm changes based on the input”.
if the input doesn’t affect the algorithm then it is constant time. 😮
Awesome!!
ОтветитьWhat a hero you highlighted on tricks that i wasnt aware of. Much Thanks
ОтветитьJust finishing my coding boot camp and trying to understand this....I know it's big for interviews but I want to have a strong understanding it. New to all this...seems difficult a bit .
Ответитьwould have been nice if u just retyped that code and then put it on screen instead of a low resolution photo but otherwise good
Ответитьit should be noted that println also takes time complexity of O(n) since it has to print every character of a string individually
ОтветитьI have an exam in data structures tomorrow, you really help me a lot , thank u man you are awsome :)
ОтветитьBest explanations, specially the last one
Thank you
I don't know if anyone will see this, but what about finding Big Omega?
Ответить