1.1 Amortized Analysis | Introduction with Examples | Advanced Data Structures | Algorithms

[@IamNGD]

After watching 20+ videos on this topic i found the one i really needed😢 thankyou so much sirji🙏

[@uzairjavedakhtar3718]

I hope you are not refering to My 20+ videos only😝 On a serious note, Thanks a lot for your appreciation. Means a lot🖤 If possible, please share the channel with your friends 🙂

[@IamNGD]

@@uzairjavedakhtar3718 Sure sir🙏👍

[@siddheshshrirame6909]

tackling such important topics , which are not covered on whole youtube with such grace and lucid explanation is really praisable. Hats off to you sirji.

[@uzairjavedakhtar3718]

Thanks a lot for your acknowledgement. Really means a lot🙂

[@technohelper4855]

I never comment .. but man this time I must say .. best explanation till now .. universities needs teachers like you

[@uzairjavedakhtar3718]

Thanks a lot for your kind words...Really means a lot :) If you really feel so, share it with your university students out there😉

[@josedamiansanchez9874]

Great example explained to differentiate the Asymptotic and Amortized analysis.

[@uzairjavedakhtar3718]

Haha! Had to think a lot before coming up with this😁 Thanks for taking out time to acknowledge it🖤

[@ur_fun]

i hope, i will see u become one of the best teachers in utube. tanx a lot. keep it up

[@uzairjavedakhtar3718]

Thanks A Lot for this beautiful comment😊 This really made my day🖤🖤🖤

[@ajinkyaawari575]

Best explanation through out whole internet 🔥🔥

[@uzairjavedakhtar3718]

Now that's what I call the best comment through out whole internet😉

[@rho992]

Loved it... after watching so many video.. I can finally understand what we are actually even doing

[@uzairjavedakhtar3718]

Really happy to know this 😊

[@Miss_YouTube_01]

Sir i watched a lot of video for this topic but didn't understand anything thank you so much sir finally understood it

[@uzairjavedakhtar3718]

Most welcome!😊

[@om7g.103]

Amortized Analysis Aysmptotic Notation - Big O Notation , Big Theta Notation Why amortized analysis is more important than asymptotic notation in some cases An example Augmented Stack

[@PerfectHilton]

Best video out here! Thanks

[@uzairjavedakhtar3718]

You are most welcome☺️

[@niharikasingh769]

Didn't get one thing, in the second example: the asymptotic time complexity is for performing multipop n times which gives O(n^2) complexity but amortised complexity is for performing multipop(n) once and then pushing the elements back. This gives you O(n) complexity. But here also shouldn't we perform multipop n times. If we do that the time complexity will again be the same o(n^2). Basically my question is why we are not considering to perform multipop n times when finding amortised time complexity. I understand we don't have the elements left after 1st multipop but after pushing the elements back can't we perform multipop again and do it n times. Cause if it had to be done only once then even the asymptotic notation will give you O(n) complexity.

[@uzairjavedakhtar3718]

Great Question! You are raising this question because you are thinking that what I calculated in the video was the time complexity of the multipop(n) operation....Had that been the case, you are right But, that was instead the time complexity of the data structure. Now, what is the time complexity of any data structure? Suppose I give you a chance to perform n operations on a data structure and I tell you that what is the worst case time complexity you can prove in these n operations? So, if you are a Asymptotic fan, you would say that you will do multipop(n) n times( as it is the most expensive operation), which is not possible continuosly as your stack gets empty after each operation. But if you are doing Amortized analysis, you will still try to do worst case operations, i.e. multipop(n) ..but remember that u can just perform n operations...in that case, once u perform one multipop(n) operation, u cannot perform the other one until the n+2 th operation. So in total, how many multipop(n) u can do in n operations? Just 1 Hence , Time complexity for n operations comes out as O(n) If still any query, please ask 🙂 Kindly share the video

[@rho992]

Thank you that makes it clear..

[@OODevelopers]

What are all the n+2 operations here?

[@vishvajithbalajee]

hatsoff to your efforts sir, keep doing more videos on ADS.👍👍

[@uzairjavedakhtar3718]

Sure. Thanks😊

[@ayushsuryawanshi9020]

Ofcourse Aman do better analysis than Asim

[@mr.curious1329]

Wonderfully explained.Compact and precise😃👍👍👍👍

[@uzairjavedakhtar3718]

Thanks for your kind words..Keep learning! And don't forget to share my channel😉

[@lol59767]

Great explanation, thanks for sharing!

[@uzairjavedakhtar3718]

Thanks, Please share the channel with others :)

[@evi5827]

Why are the costs of TC1 O(n^2), when you multipop all n 1? wouldn't it be just one opertation of O(n), where the costs are O(1) for the whole stack? why multiply O(n) x n? Great video btw!

[@bandladeepika8452]

Where i found notes sir for this topic

[@bandladeepika8452]

Sir please give link for this topic notes

[@himankgaming7555]

6:20 i really though my earphone is gone before realising that the audio is like that BTW great explanation sir

[@uzairjavedakhtar3718]

😂 Thanks😉

[@mysterioustwist1894]

Loved the explanation sir❤😊

[@uzairjavedakhtar3718]

😍

[@sargamgupta7134]

Great explanation!

[@uzairjavedakhtar3718]

Glad to know that you liked it☺️

[@b_01_aditidonode43]

amazing explaination

[@uzairjavedakhtar3718]

Thanks 😊

[@yomamasofat413]

so to put it simply just look at the average? which is just O(1) because it happens most of the time

[@BeingAplomb]

Yes that's the actual meaning of Amortized analysis ... Average time complexity of each operation

[@minhazfuad7493]

Thank you so much, it was really helpful...

[@uzairjavedakhtar3718]

If it was helpful, it's worth it for me😊 Thanks for the appreciation🖤

[@AshutoshKumar-lp5xl]

clear and understandable

[@uzairjavedakhtar3718]

Thanks😀😀😀 please share the channel if you liked it🙂

[@Abhijeetgaming274]

next videos?

[@uzairjavedakhtar3718]

Entire playlist link : kzbin.info/aero/PLv9sD0fPjvSHqIOLTIvHJWjkdH0IdzmXT

[@enzoarguello512]

Thank you so much!!

[@uzairjavedakhtar3718]

You're welcome!☺️

[@mikedelta658]

Thank you!

[@uzairjavedakhtar3718]

Most Welcome😊

[@deepakgoyal3250]

And he saved me

[@uzairjavedakhtar3718]

🤩

[@timz2917]

why was it not 2n / n +1

[@trijalsharma4471]

Genuine doubt

[@unnatigoel809]

Masth

[@uzairjavedakhtar3718]

Thanks A Lot Unnati :)

[@unnatigoel809]

@@uzairjavedakhtar3718 please upload potential method as well

[@ketan9287]

I found the video very helpful, but is it just me who is feeling dizzy watching it?😵‍💫

[@srinivaspeethala8400]

yeah, i feel dizzy due to the f'd up audio

[@manishvishnu2654]

💖

[@uzairjavedakhtar3718]

😊

[@trijalsharma4471]

😒