Clear explanations: ✔️ Useful analogies: ✔️ Not monotone: ✔️ Confident: ✔️ You're a different breed, Caleb. Amazing teacher

I feel like this video explains algorithm analysis much more efficiently than other videos that had over a million views.

@muhammadaarizmarzuq295

2 жыл бұрын

yeeh lol

You're an underrated gem on KZread, you know how to teach. Thanks for all the work.

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.

The best explanation of big O notation I've ever watched, thank you.

This guy makes difficult concepts look easy by his ability to simplify things. Thanks a million

Thank you so much. I always thought I was too dumb to grasp these concepts, but you are making miracles happen. Please keep on with these instructional videos !

@Grassmpl

4 жыл бұрын

This crap is so easy wait till u do amortized analysis.

@abhishekprabakar2775

4 жыл бұрын

stgeorgidgdfgdfgdfgdfgdfgdfgdfgdfg

@bingkysskiliwaax7941

3 жыл бұрын

@@Grassmpl whatever

@krishshah3974

3 жыл бұрын

ikr @Kozak Juan Grillin, felt the same way

I really liked the parallel with a car. This is for sure the best explanation of BigO on whole internet :)

@serenedipity4052

2 жыл бұрын

Agreed!!!

Thank you Caleb this was the best tutorial to help me understand these concepts

After completing your python playlist. Now I will stuck with this playlist...♥️

Watched the freeCodeCamp 8 hour video on data structures start to finish. Nothing made sense until I started watching this series.

@nyashandarowa927

2 жыл бұрын

Thought it was only me 😂

Dude you are so cool, I've watched many of your tutorials and they all ROCK!

Thank you! This came at the right time after going through your c# tutorial. It was great 👏👏

I swear you Summed up an hour of my professor's explanation time much better and I actually understand, THANK YOU

Wow! YEARS I spent thinking I "knew" what O(1) meant, particularly with arrays. Your explanation using the memory address location was absolutely brilliant! I'm going to use a variation of your explanation to help others. Well done!

Dude (if I may) Thank you so much... Great work!!! Love your style of teaching. I hate when people says programming is easy (specially from 12 years kids, haha). Your youtube channel is one of the best for teaching programming, it's more than just tutorials. I can see you get even more comfortable on camera through all the videos, hope you can use this skill in your private life !!!

Great video - helps for people like me who struggle to intuitively 'get' anything thats even vaugely like maths!

You're a natural teacher!

So nobody is gonna talk about the amaizing outro!?? I am really enjoying it as reward for finishing the videos 😂

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.

This video deserves millions of views!

Keep rocking 👨‍💻

Thank you man. You explained this concept so simplistically for me

🙏 thank you!!! For this please Keep making crazy hard topics easy.

Awesome job explaining this!!!!!!

Hey Caleb u did an awesome job.

Caleb I love you! Thank you so 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!

You helped me a lot. Thank you so much

I'm studying for my data structures test rn. Wish me luck ;P Thanks for the great content!

Thank you, this is make my day!

Thank you so much!! You have a great explanation skill bro! Keep teaching us👍🏻👍🏻👍🏻

I smashed the like button when I saw you drawing the car. Good one 👍🤣

Smooth and simple🙌

Wow It's great video from caleb

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.

Awesome video 👍

you must include a class on Array as well as common mathematics like n! log and etc

thanks for this vid 🙏🏾🙏🏾

shouldn't O(1) line be higher on the graph? Like where 1 is supposed to be on the actual graph?

is it correct to say that in your example at 5:40, the worst possible case was if there were no int 3 in the array? If it was a for loop, it would still have to check if it should keep running or not once it checked that the 3 was not on the 8 index, but the for loop will check if it is the last index or not once again.. so it would be 10 times and not 9? Or you just count if the algorithm inside the for loop is executed?

Thanks Caleb.

man you are the best.

Thank you good sir!

Clear explanations

This guy is awesome! :D

dear Caleb, I really like your videos. What I like the most is that you always make these small jokes...like: "O man, I dropped my chalk for the 4th time " ...it really helps people stay concentrated :) its not like constant input where you fall asleep!

Thanks, please keep it up

Thank You!

I appreciate you. Thank you.

very clear thankyou

Plz don't stop this series

Best video on Big O notation y didn’t I know you in school 😅

thanks for the video

thank you Clear explanation😇😇😇😇😇😇😇

Astounding !

On 12:52 do you just input "sally" and you will retrieve it?

9:48 I assume the screen mentions array insertion by mistake? Confused me a little because afaik it's not as fast as O(1). And you didn't show it in the example, only retrieval

Hey Caleb Curry, where do I access the code for this video?

Love calebs laugh :-) its like mikey mouse! Keep up the good work caleb. Im a C# Don cause of you!!

Jesus Christ, Thank you so so much for this. You're a life saver.

You are so much better than my uni professor!!!! I get it now! You're so cute too :)

Bro will u teach tkinkter also for gui in python

thx a lot!

thanks a lot

thank u so much

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!

@devonm

11 ай бұрын

Time complexity isn't about calculating the actual operations for a particular example. O(n) means that, in the worst-case scenario, it will take n operations to finish. If you were looking for the best-case scenario, it would be 1, and the average case would be n/2. However, O specifically refers to the worst case, so in your example, it would still be O(n) because we don't know/care that it only took 3 operations.

Crypto buddy ! Amazing teach.

Is the hash key unique in every list? How does it sort and search for hash keys?

Wow thanks

the n! slowmo cracked me up

Very cool

when the lecture ends and I hear the music it fells like I'm in a different world.

hi dude

@abhishekprabakar2775

4 жыл бұрын

thnx

Do you need to know linear algebra and discrete math to practice coding interviews?

#include using namespace std; void main() { while(1>0) { cout

Been sitting eyes wide open behind these four walls, hoping you'd call It's just a cruel existence like there's no point hoping at all Baby, baby, I feel crazy, up all night, all night and every day Give me something, oh, but you say nothing What is happening to me? I don't wanna live forever, 'cause I know I'll be living in vain And I don't wanna fit wherever I just wanna keep calling your name until you come back home I just wanna keep calling your name until you come back home I just wanna keep calling your name until you come back home I'm sitting eyes wide open and I got one thing stuck in my mind Wondering if I dodged a bullet or just lost the love of my life, oh Baby, baby, I feel crazy Up all night, all night and every day I gave you something,…

I like it by example not theory

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.

i swaer if i have to see a udemy ad for the 4th time in one video,AGHHHH!!!!

Isn't O(n^2) is slower than O(2n). Not to point out a mistake but letting know everyone not just copy paste.

Dude I like your videos man, you kinda look like Jack Harlow though

Nice ....but more add

Sir what is your name

Sloooow!😍

Thank you for the lecture but ad pops up every 2 minutes. difficult to pay attention.

Bogosort O( (n + 1)! )

The question is...why are you so cute :)

@spitfire7914

4 жыл бұрын

No homo

junk like that ..

That's the ugliest drawing of a car I've ever seen XD. But anyway, great video!