6 years later and this is still the most clear and concise explanation I've seen

A) Drop lower order terms B) Drop the multiplier C) Total running time is sum of fragments. For large input sizes the the run time depends upon the fragment with highest run time D) If there are two cases possible the time complexity depends upon the worst case scenario (the one with largest time complexity)

Most Clear and Concise Explanation.

I am in grad school for software engineering and love to program. I've seen a lot of channels, many good ones, but yours is one of the absolute best. I come back to your videos to refresh and learn, pick up stuff that went over my head the first time around.

Your explanations are some of the best CS videos I have found anywhere, including videos from universities! Your channel has a lot of videos, some idea of which playlists and videos to start with and what to watch next would be great. Great job!

The best video on the entire web about Time Complexity.

This channel is PURE GOLD!!

This tutorial video was so well explained. Suddenly entire concept is looking so simple!

i wanna give u big thanks since, u present the time complexity in a easiest way ever seen. keep it up

Thank you for these videos! The book I was studying started talking about O() time, which I generally understood, but then it started in on T() time and using them in equations together also and I couldn't work out what made the two different and how they fit together. These videos gave me a clear perspective with which to finish my chapter.

Thank you for making this video! I am currently taking an algorithms class and this part of the class is giving me the most trouble in understanding the time complexity of the code. Your guidance of this topic makes things so much simpler to understand.

Best explanation of time complexity analysis. Thanks a lot for the video.

The only and only explanation that helped me understand this analysis. Really thankful for the effort you put into making these videos.

You should explain the Theta and the Omega general rules as well, it would be awesome, finally I understand how to calculate Time Complexity with your videos. :D

Excellent lecture on time complexity, thanks for posting!

A great series of videos... short yet so descriptive. waiting for the upcoming ones!

Thank you for your clear explanations. Good teachers and tutorials are rare enough.

The only video you needed for this series

Love your videos. Everything makes so much more sense now...

seeing comments from 4, 5, 6 , 7 years ago is so eerie it gives me chills...

this is so helpful, the whole big o thing clicked to me by watching this video. Was still a little confused watching the first few videos in areas but this video made 100% sense to me. especially when you demonstrated just to focus on the areas that have the biggest impact to overall time and the outer and inner loop example was great for me, saying n loop x n loop = n^2 clicked inside my head. thanks again, best big o vid on youtube and ive watched heaps of them. please make some more vids on some recursive examples if you could

Take a bow. Amazing explanation. I find myself lucky that I have found this video in my search results.

Your explanation clear my all doubts, so thank you so much

Thanks a lot Stavros. We will try to get more in this series.

Finally! A video where I got the understanding of time complexity. Thankyou so much for this incredible explanation! Subscribed to your channel after watching this 1st video itself! Thankyou!!

Bhai!!!! Yaar really good explanation for the first time i get clear about time complexity. Such a simple and good explanation!!

Prof needed 1+ hour to explain this :) thanks for your videos!!

Thank you so much!!! I barely understood the topic and your video made it all clear for me! If I could, I would have given you a thousand likes! :)

this is gold

Great explaination after 9 years it is also clear to understood

best video ever on time complexity

You are the best ! I was confused and lost even after reading lots of explanations.

Aweeeeeesome Explanation..I was missing that in my life..Keep going

Wow what a great start on algorithams :) , you have explained very well and made a great foundations. Thank you so much!!!!

This was exactly what I needed to hear. This should be taught prior to backward substitution.

my god why did i find this guy so late. this man is amazing

Very good, informative and excellent work. Keep going

Way of teaching is excellent.

Thanks for the detailed and clean explanations.

you dont know but actually you are doing a great service to the student community...lucky to come across your videos...

sir you are my god..awesome teaching..plzz do more on algorithms plzz sir so that we can get help in our gate

Awesome Explanations !! Really helped a lot.

u taught so well. got the whole concept .....thanksss

thank you for making this so easy to understand.

Very Clear Explanation... Thanku so Much....

It is a really good teaching video, well explained, thanks you so much!

Thanks a lot Bro .... Really Appreciate your Efforts and very well explained.

I know this is old but you’re the best!

So appropriate!!! It is so hard to find a correct explanation. There is no certainty of material available on the internet. This series seems correct so far! VVVVVEEErrrryyyy Good!!!!

Best explained. Understand in one shot.

Sure ! stay tuned :)

Thank you for the extremely precise and accurate video. 45 lecture videos and this still somehow manages to explain it better, more efficiently and in simpler terms

This was very helpful. Thank you!

Excellent work! Already proposed it to all my classmates in one of the best universities of Paris! Please add the O(logn) and O(2^n) cases when possible. Thanks a lot.

you are my savior!!! I couldn't have passed any of my classes without you. please tell me you continued this series somewhere ???

Wow your explanation is very clear. our lecture spend hours to explain this

simple and clear explanation, thanks for the video :)

really sir all these classes were crystal clear 2 me, although i have joined a separate course for this i barely understood this topic, thank u very much ..but what about the further topics ..... please post them ASAP... looking forward to them

great tutorial. very good teacher.

Sure Tudor, we will try to get more. :)

Thanks. Very very helpful.

Thanks for your kind words Anthony :)

thanks bro this helped me get good grade from my exam today!

Thank you this cleared up a lot!

Thanks a lot, all the 4 videos wer very helpful...

Thanks- very clear explanation!

Boss you are great :) Thank you so much for all detail explanation.....

Excellent video! Thank you.

We need a continuation of the series, please

thanks for making this video, very helpful!

Please do the complete series on design and analysis of algorithms. You are the best teacher I have ever encountered on KZfaq.

You guys aer really awesome. Please continue to make. Love 😍

Thanks brother ... Lucid and best ...

Thanks a lot Josey !

awesome stuff....loved it

Thanks a lot for the explaination .you made it simple :)

good job sir. very nice explanations.. keep doing

you never fail...

Great !...explained nicely!

Great explanation !! thank you.

love You Sir!!!Your Just Awesome.........

Thanks Madhu.

It was very helpful thanks a lot to u....

You're among those few who provide playlist link in the description !

Nicely explained... thanks a lot :)

very good explanation thank you!!

Awesome explanation ..

Great content!

Perfect video!

very good one.. thanks..

Sad to hear about your friend's story Animesh, Stay Strong!

Awesome! Where are the follow-up videos?

Thank you so much.

Thanks a lot! Very helpful

Hello sir.. u did lots of efforts to make us understand the above Complexity topic, but to make a perfectionist over this topic would you please upload some more videos over this topic by which we will get over all concept of complexity like log(n),log k(n),log b(n) etc related to this ..thank you so much anyways :-)

Thx a lot , this is rly very Helpful :)

please make video on implementation of calculating time in c++

Thanksss....very helpfull,

At 4:38, O(n+1) might come as loop would even check/compare i=n and then return false.... but it would use time in comparing! If n tends to infinity than we can neglect constant and keep it as O(n)

U R a best one...thx