This is an introduction to using asymptotic notation for program analysis, for simple loops. It assumes that you’ve already watched the video with definitions of the asymptotic notation functions. After…

Hi everyone, this is gkcs! We are taking about why log appears many times in complexity analysis. So if you’re just starting off and maybe you came up with binary…

In our previous lesson, we tried to understand the importance of sorting as a computational problem. We have so many sorting algorithms designed over a period of time, mostly to…

We’ll now study performance analysis time complexity Time complexity of an algorithm is the amount of CPU time that it needs to run a particular program time complexity is also…

Welcome! In this video I’ll be discussing the “Selection Sort” algorithm for sorting lists of items. Selection sort is one of the simplest sorting algorithms out there, both conceptually and…

Hi everyone, this is gkcs! We are talking about a very fundamental topic of computer science today! Which is: Complexity Analysis. When you have an algorithm given to you, you…

Hey everyone. In this video, I’m going to give you an introduction to Big O notation and time complexity. These concepts basically give you one way of describing how the…