Відео

This was amazing

just commenting to let you know this has been really useful for me. thanks!!!

Thank you ❤

helpful

I have final in 20 minutes wish me luck guys

Thank you so easy and clear explanation.

clean 👍🏻

sound problem

Can we do algorithms in python

This was very helpful!!!!!! thank you.

What’s wrong with the Audio for headphones

You told us how to disprove big O. How to disprove big omega and big theta?

If I get something like 7x3 + 3x2 + 23 is O(x4). So do I bump the exponents to x4 like; 7x4 + 3x4 + 23x4. Right or no?? Help

If I get something like 7x3 + 3x2 + 23 is O(x2). So do I bump the exponents to x2 like; 7x2 + 3x2 + 23x2. Right or no?? Help

🙏🏻🙏🏻🙏🏻🙏🏻🤍

prevent unnecessary talk

Amazing explanation, thanks for this video - bumping tricks its amazing

Literally best explanation ever

Discrete Mathematics and Its Applications 8th edition

thx man

cs182 at purdue is awful. its a joke and you make it better thank you.

why don't more instructors highlight the fact that you don't need to have a specfic one solution for prooving big O. this has been confusing me for few weeks until now. Thank you so much.

Been struggling with this notation till I stumbled upon this video. Thanks !

THANKYOU ❤️

Shukriya sir

Assalam o Alaikum Ma Shaa Allah

Why did we say x = 5?

Thank you sir, you explained it very well

video from Neso academy theft

Bro is underrated

Thankyou for the great explanation

sir what if "that starts with 0 and end with 0?

an underrated video

So simple and easy way thanks Sir 💗

Thanks a bunch!

Oh my GOD I love you. Thank you Sir!. Hope u r doing well

helpful

THANKS U FOR THIS VED

thank you, could you please do some exercises from book

Your videos are great! one question though, why can't x be equal or greater than 1 at around the 8:00 minute mark? Thank you and sorry for the very late comment

So glad I learn more from youtube than a class I'm paying $1200 for.....thanks for the video, this helped tremendously! 3 Reply 1 reply @nveemusic @nveemusic 4 years ago 10 mins of this literally increased my study efficiency 11 Reply @schokomiko @schokomiko 6 months ago Thank you very much teacher! Reply @themanwhoiscompeng1422 @themanwhoiscompeng1422 3 years ago your video's so helpful for cs students thanks a lot 1 Reply @p.c2750 @p.c2750 2 years ago One min into your tutorial, i give you thumbs up because of paying attention to details Reply @junlee9437 @junlee9437 3 years ago It helps a lot a lot.... Thank you! 1 Reply @krissharma7333 @krissharma7333 5 years ago Very Well Explained. Thank You Very Much. 2 Reply Discrete Math videos · 1 reply @fahinrahman8951 @fahinrahman8951 2 years ago so when you do the method of changing every variable to the highest degree, will k always be > 1 ( x > 1)? Reply @sonsc5283 @sonsc5283 2 years ago very good explanation! Reply @nabilabd.6998 @nabilabd.6998 1 year ago Thank you very much. I didn't listen during the 1hr lecture and I've got it all here in 10 mins. Thanks again Reply @ericcheek2983 @ericcheek2983 4 years ago Awesome video, thank you so much Reply @MrRANDUM145 @MrRANDUM145 2 years ago This helped a lot! I can actually understand what you are saying unlike my thick accented teacher 7 Reply @misterlight5115 @misterlight5115 3 years ago hmm the book were using in my college class just says to use 2 rules remove all the constants (5 +n becomes O(n)) and use only the highest order (so like x + x^2 becomes O(x^2)). However, this is a programming course so that could be why but this video still did help 2 Reply @user-uk6gj7up6i @user-uk6gj7up6i 5 years ago Great explanation!! 1 Reply Discrete Math videos · 1 reply

Are C and k assumed to be positive integers?

Thanks

After 20 different Big-Oh videos, I finally found the one. Tysm!

Very authentic

Thanks!

Can you also explain inverse and composition of functions, and the the graph of functions and partial functions?

Great explanation!!

Thank you so much for the great explanation! I can not wait to wacht all the other playlists the coming weeks. ❤

This is why UA-cam is amazing. Thank you.