I was thinking maybe you could make some assembly language tutorials. Most of the other assembly tutorials on YouTube suck and you'd make some good ones.
@kdmq just learn C from xoax and work backwards.... jk, I know it's not that simple. I had to learn assembly language for a class. But knowing about C, especially how pointers work, actually does help a bit. Good luck
Sorry, i don't like this. I already understand the basics of the notation, but I was hoping for some insight beyond what's in the textbook. Specifically, examples of non-intuitive functions that are in big-oh etc. Not just f(x) and g(x). For instance, I'm really confused about: is it possible to have a function that O(g(x)) but NOT Omega(g(x)).
Sorry, I don't believe it's correct to say what you listed. big O is not necessarily one function it's a SET of functions that are greater than f(x) at a certain point. So if you think of big-O as the max running time, then that's not strictly correct.
This video should have examples. For instance, if f(x) = 3x+2 then that's O(x), right? But it's also O(x^2), O(x^3) etcetera. If I have mislead you, hopefully someone will comment.
This has been flagged as spam show
I will be graduating from college this year and I can say that your few minutes videos are better than hours of of lecturing at university.
GoinbcK 1 week ago
Comment removed
GoinbcK 1 week ago
Thanks- good video, good voice.
drokreative 3 weeks ago
THANK YOU!
KnightRite 3 weeks ago
thanx
kumasarukalith 1 month ago
Plz dont stop. This is how im passing my tests. =D
rsnjawarrior1 1 month ago
@rsnjawarrior1 Btw leave the music, It is soothing and beneficial, I am very into music. Keep it. KEEP IT!!!!
rsnjawarrior1 1 month ago 3
WOW I was reading so many books on this and did not get it. The visuals REALLY helped. THANKS!
MrTeeeeez 2 months ago
This has been flagged as spam show
You guys are awesome. This video makes skipping my discrete course so much easier!
ShivMan007 4 months ago
Comment removed
ShivMan007 4 months ago
Comment removed
ShivMan007 4 months ago
Great way of elaborating the most complex topic in data structures. these concepts were out of my mind until I found your video
jiakhan1 5 months ago
OMG THANK YOU
yesifailed 5 months ago
@chukoxix you should start from the first class, it will only take you 15 minutes.
Mairoable 6 months ago
i lost you at "g of x"
1ma4ighter 6 months ago 8
It will be better if you take out that music
saa442 6 months ago
Thanks. You rock!
tehzapa 7 months ago 2
Thank you so much!
FacepuncherBlog 9 months ago 2
But where's Big Fau and Big Duo?
Judex777 9 months ago
@Judex777 MY HERO
Xunnamius 5 months ago
BIG O! SHOOOOW TIIIIIME!
Calgarian 9 months ago
no other video compares in clarity on this subject. excellent job.
Kaleetos 10 months ago 4
excellent lessons guys ...
LIGHTSAT1 11 months ago 5
3 dislikes, they must be idiots
MohaSharpeyes 1 year ago 7
Thank you :)
SomaComa89 1 year ago
Excellent. Best explanation of bounding functions I've ever seen.
The explanations in books that just give formal definitions (with no graphs) are garbage - they don't adequately explain what's going on.
region1111 1 year ago 5
Thank you so much!!!! I really needed that visual help in understanding these notations!
Malaari 1 year ago
wow!!! thanks i need it for discrete math!!
Jubiejai 1 year ago
I was thinking maybe you could make some assembly language tutorials. Most of the other assembly tutorials on YouTube suck and you'd make some good ones.
kdmq 1 year ago
@kdmq just learn C from xoax and work backwards.... jk, I know it's not that simple. I had to learn assembly language for a class. But knowing about C, especially how pointers work, actually does help a bit. Good luck
Ms4dmin 1 year ago
I have a CS final later on today, thanks to this video Ill do better than I would have without it =)
MissingLinkMusik 1 year ago
These videos are some the clearest computer science explanations I've seen -- thanks!
samdutton 1 year ago
really well explained, when is the 7th part coming out? wish you could have added the small o and omega notations too...
ART000747 1 year ago
Excellent explanation.
shekharumich 1 year ago
Easy learning
Thanks for uploading...
vaisakhcp1 1 year ago
It explains it as clearly as possible in the least amount of time. Big O, Theta, and Omega, are very clearly explained. Thanks.
dvargas001 1 year ago 2
thanks,detailed and very well explained
newdriv 1 year ago
Sorry, i don't like this. I already understand the basics of the notation, but I was hoping for some insight beyond what's in the textbook. Specifically, examples of non-intuitive functions that are in big-oh etc. Not just f(x) and g(x). For instance, I'm really confused about: is it possible to have a function that O(g(x)) but NOT Omega(g(x)).
KittenToez 1 year ago
Why does he say g(f(x)), that annoys me!
TeTRoSeX 1 year ago
@TeTRoSeX He says g of x, not g f x.
aawood 1 year ago
@aawood Oh I see
TeTRoSeX 1 year ago
Thanks a lot.
Keep up the good work.
Don't mind the low video watch count.
cooolway 1 year ago
very nice. thanks.
hexam1ner 1 year ago
You have explained betterr than MIT proffesor
BeIwantTo 1 year ago 6
way to formal, just come out and say big O is the max it will take
kj369kj 1 year ago
@kj369kj
Sorry, I don't believe it's correct to say what you listed. big O is not necessarily one function it's a SET of functions that are greater than f(x) at a certain point. So if you think of big-O as the max running time, then that's not strictly correct.
This video should have examples. For instance, if f(x) = 3x+2 then that's O(x), right? But it's also O(x^2), O(x^3) etcetera. If I have mislead you, hopefully someone will comment.
KittenToez 1 year ago
Excellent! Thank you!
harmtouch 1 year ago 5
Nice, I was having a hard time understanding this Sci-Fi stuff :P in my computer science course =_=
I'm a visual learner so this is very helpful to me
thanks for the vids
SayianZZ 2 years ago 9
I wish i was you. (guy talking in the vid)
mstrlol1 2 years ago 4
you just CAN NOT synthesize better the this! Great work.
bboysil 2 years ago 5
Very informative :) Thank you alot
Waranle 2 years ago 3
simply can't wait for more
iamawesometoo 2 years ago 32
you guys are one of the best sources for algorithms. thanks so much. im a high schooler and learning this stuff is hard to come by
psychofish25 2 years ago 47
same situation for me
woulders 2 years ago