Guidelines for Asymptotic Analysis (Part 2)

Data Structures: Guidelines for Asymptotic Analysis (Part 2)
Topics discussed:
1) Calculation of Time Complexity when we have an if-then-else statement.
2) Logarithmic Complexity.

Music:
Axol x Alex Skrindo - You [NCS Release]

#DataStructuresByNeso #DataStructures #AsymptoticAnalysis #BigONotation

[sauravkumar]

Wow.... I have to admit that I learned something amazing today from this lecture....
Thank you so much sir

[GJoshi]

2:29 today I came to know the real meaning of logarithm.

[AishLovesSpaghetti]

I was not sure if I'll be understand logarithmic time complexity but your explanation with examples made everything clear. This is hands down the best video on logarithmic time complexity Thank you for this awesome explanation.

[tholaalw]

I studied big of Log2n and stuff in college, but didn't understand fully until now. Thank you

[soujanyavt]

Understood completely...thank u so much

[RownakIkram]

God bless you Sir, I tried 9-10 tutorials bout time complexity, and i was almost tired of everything, was almost accepting my defeat then i searched Neso Academy.A life saviour🙂

[inesabbes]

Your way of explaining it is awesome!!!

[nicknick]

Thanks
Online classes me kuch samajh waise bhi nhi aata but your lectures are really very nice and helpful. Yhi se padh k sara syllabus complete kar rha huu.
Thanks a lot sir 👍

[stephanenouaffo]

Waouh ! Is there a word more powerful than Amazing for this lecture?
Thanks so much

[-kalwarmohit]

thank you so much sir, today i learned what really logarithm means keep guiding us sir

[warrenkuah]

You made understanding logs sooo easy! Legend!

[soyandoat]

Thank you so much for your videos! Finding your channel has been such a blessing to me

[shivamrajput]

Statement in for loop conditions(i++ and i<=n ) will also be evaluated

[elhambhuiyan]

Sir thank you for such great lectures. Will you do any lecture on algorithms? It would be really helpful to learn algorithms alongside with database

[vasireddyganesh]

Sir please upload videos as fast as possible sir... So that we can complete our course in these holidays

[fectmedia-]

when you iterate the for loop you say on the third iteration the value of i = 4, but not 4 rather i = 6. how this happens sir🤔

[harry]

Then how about the loop that has the condition as follows for (int i=1;i<=n;i+=3), what will be the time complexity

[ssr]

let's say in the example n=17 instead of n=32. then, the loop will run as long as i=16 then, it won't iterate further as the next value will be 18 which is greater than n=17. So, here in this case 2^(k-1)!=17 as in the last iteration k= 5 and 2^4=16. [then we shouldn't write n=2^k-1]

[aryanmehta]

sir, when u provide whole series of this topic

[kunalsoni]

I can't understand log complexity any where ..
But after watching this video I understood everything 😊😊😊😊😊😊 about log