Відео

I think it is < instead of <= for small o and small w notations between f(n) and c(g(n)). But thanks for the videos. They are really helpful as the book is quite difficult to comprehend. At least up to this part.

Web notes?

You explained this for just about anyone to understand. A good professor is hard to find. Thanks for these videos.

thanks for the lecture series. can you post the exercises and problem set as well?

Where do we go for the solutions? Whats the link?

You should really strikethrough your zeroes when working with 0s and Os. Makes the video quite confusing.

6 years after introduction to algorithms, I have finally understood asymptotic notations

Bc.. Baap video banaya hai.. thanks matey

great explanations

I think there is a slight mistake in your definition of monotone decreasing function and strictly decreasing

thanks for the video , very well explained just a small mistake the definition is exactly less < : o(g(n)) = { f (n) : for any positive constant c > 0, there exists a constant n0 > 0 such that 0 ≤ f (n) < cg(n) for all n ≥ n0} . for omega : ω(g(n)) = { f (n) : for any positive constant c > 0, there exists a constant n0 > 0 such that 0 ≤ cg(n) < f (n) for all n ≥ n0}

Thanks uploader these are very useful videos they are so much more clear than my textbook.

great work really thanks alot sir

Thanks for an excellent series of lectures! I've learned so much because you know how to teach this material. Plus I now want to hike Hawaii.

In your explanation (6:25) you say that for little o n^2 not equal to n^2 and for little omega n^2 not equal to n^2. But in your definition just above you wrote less than or equal too. Which is correct?

It's infuriating how some professors will cling to the formal definition without illustrating the analogous meaning of each function. I feel this is a very poorly designed notation if only because each function is named so arbitrarily. Thank you for the simple answer I was looking for.

thank you

nice videos! Whats the graphing calculator you are using?

Thanks, the video was useful.

Thanks helped me figure out the assumption step. I would recommend writing more clearer because i found it hard to fully see what you were writing. Explained very clearly though

that was one amazing lecture :)

thanks for the clear detailed explanation. This really elucidates the dense writing in my book

best explanation on LCS. Thank u

Sir, it's the best video on DAC , you explore the every expect on this algorithm thank alot.

You mean h2(k) relatively prime to m, right?

wow, thanks! and great example :D. I wish my university had also this good study materials...