Комментарии:
Isn't O(n^2) is slower than O(2n). Not to point out a mistake but letting know everyone not just copy paste.
ОтветитьThank You!
Ответитьyou must include a class on Array as well as common mathematics like n! log and etc
ОтветитьThe best explanation of big O notation I've ever watched, thank you.
ОтветитьEvery one just use the graph and tell you this is o(n) this is o(1) this is o (log n) but noone explains the math behind it.
so do we jsut memorize this and when we are ask just blur out what we think we know.
man you are the best.
ОтветитьIs the hash key unique in every list? How does it sort and search for hash keys?
Ответитьhad a question: For O(n), will it still be linear if n was like 9 but it found the number it wants in an array at index 2 or something? because wouldnt that be 3 operations, making it not linear? love your video!
Ответитьthank you
Clear explanation😇😇😇😇😇😇😇
Thank you, this is make my day!
ОтветитьThese are a good damn videos, I don't know why the heck is not more visited. By the way, for all of us college students of CS, we appreciate these kind of videos. Thank you Caleb.
Ответитьjunk like that ..
ОтветитьYou are so much better than my uni professor!!!! I get it now! You're so cute too :)
ОтветитьThank you man. You explained this concept so simplistically for me
ОтветитьSir what is your name
Ответитьthanks for the video
ОтветитьCaleb said he stinks at math in this video. A few weeks ago I needed to learn binary counting and this man was able to teach me how to do just that via a video he made when he was a young kid.
ОтветитьThank you so much!! You have a great explanation skill bro! Keep teaching us👍🏻👍🏻👍🏻
ОтветитьClear explanations
ОтветитьClear explanations: ✔️
Useful analogies: ✔️
Not monotone: ✔️
Confident: ✔️
You're a different breed, Caleb. Amazing teacher
This guy is awesome! :D
ОтветитьWow It's great video from caleb
Ответитьthe n! slowmo cracked me up
Ответитьthanks a lot
ОтветитьCrypto buddy ! Amazing teach.
Ответитьthx a lot!
ОтветитьThanks Caleb.
ОтветитьThis is the best explaination I have seen about bigO. "number of operations", this enlighten me, make it is easier to understand an abstract theory like BigO. Thank you very much.
ОтветитьBefore watching this video I'd read all this stuff and didn't understand a thing. Now not only I understand, but even like it)) Thanks a lot!
ОтветитьHey Caleb Curry, where do I access the code for this video?
Ответитьthanks for this vid 🙏🏾🙏🏾
ОтветитьI'm studying for my data structures test rn. Wish me luck ;P Thanks for the great content!
ОтветитьAstounding !
ОтветитьWow thanks
ОтветитьThat's the ugliest drawing of a car I've ever seen XD. But anyway, great video!
ОтветитьThis video deserves millions of views!
ОтветитьVery cool
ОтветитьI appreciate you. Thank you.
ОтветитьDude you are so cool, I've watched many of your tutorials and they all ROCK!
Ответитьwhen the lecture ends and I hear the music it fells like I'm in a different world.
ОтветитьI swear you Summed up an hour of my professor's explanation time much better and I actually understand, THANK YOU
ОтветитьThank you Caleb this was the best tutorial to help me understand these concepts
ОтветитьWatched the freeCodeCamp 8 hour video on data structures start to finish. Nothing made sense until I started watching this series.
ОтветитьI really liked the parallel with a car. This is for sure the best explanation of BigO on whole internet :)
ОтветитьThis guy makes difficult concepts look easy by his ability to simplify things. Thanks a million
ОтветитьBogosort O( (n + 1)! )
Ответить