Комментарии:
didnt know 6 months of study coudlhv been just a 6min vid.
ОтветитьSir, I am very, very sorry not mentioning you title , you are great teacher,you just target what we learner need thanks a lot 😂❤❤❤❤❤
Ответитьthanks
ОтветитьYour video was o(1) for my mind ❤ thank you
ОтветитьUseful video! Thanks bro
ОтветитьI learned more in 6 minutes , then I did going to class and tutoring for the past couple of weeks
ОтветитьThe things I've always adored about computer science is how I struggle understand a topic until something snaps in my head, and it all becomes child's play.
Ответить<3 Thank you
ОтветитьBro, Thanks! Appreciate it!
ОтветитьRandom comment
ОтветитьAmazing ❤
ОтветитьI'm really grateful for this channel, it save me in a lot of time.
ОтветитьGo to heaven!
Ответить🎉🎉🎉 tanks
Ответитьdropping random comment lol, in computer science i my school am we are still learning Chemistry and physics well i can wait forever why not start now, Nice lecture though
ОтветитьMy professor's explanation that took me 4 months but still didn't get it, until I saw this video.
ОтветитьSo we can also say that the shorter the data, the faster the supposed slow big O notations? Like 0(n^2) is faster than 0(log n). I'm no cs student so I'm bad at math 😞
Ответитьsweet
ОтветитьThanks for the help
ОтветитьExtremely straightforward
ОтветитьGreat video bro, subbed.
ОтветитьMy whole sophomore year was wasted
Ответить“you get expelled”
imagine getting expelled over bogosort lmao
clear explanation 👌👌
Ответитьhell ya
ОтветитьThanks, it blew my mind
ОтветитьGreat video man!
ОтветитьSimple and covered. Thank you
From Sri Lanka
That was the best explanation of the topic i found on the whole internet. Thank you very much
ОтветитьThanksssss❤❤
Ответитьthanks bro
Ответитьgood to hear you in a non-coding video lesson, bro!
ОтветитьHonestly, the best explanation of Big O, thanks you!
Ответитьin the first example I dont understand the similarities of the 2 functions, anyone with input on this?
Ответитьfire explanation! thanks!
ОтветитьThank you! This is a great foundation for me to learn more.
ОтветитьThose 6 minutes were more useful than 6 months of lectures. Thanks
ОтветитьThanks !
Ответитьwow very good explaination thank you!
ОтветитьRandom comment
Ответитьthis is huuge, well done man.
ОтветитьThank you Bro
ОтветитьThanks bro
ОтветитьCollege is a scam but unfortunately we gotta do it
ОтветитьHold up, how are the two functions at the start the same??? first one adds up n, the second one performs exponentiation and divides it by 2? Two different results.
ОтветитьThank you! Great code examples to demonstrate the "steps" it takes. :D
Ответитьidk how ppl struggle on a concept like this 💀💀💀
Ответитьrando comet
Ответить