Hi Caleb, I just wanted to let you know how amazing you are at explaining !!! Honestly, I am understanding more from you than all the places I have looked for explanations in the past year! You are amazing, please keep doing videos, may God bless you!!!
Why am I not seeing these kinds of people teaching at Universities? Had to take Data Structure & Algorithm twice in College and still not clear until I started watching your vids. Thank you!!!
I'm really glad you explained how logarithms work lol. I was just about to look up another video to explain it to me when you did it, so thanks. You shouldn't feel embarrassed.
you are more of a good teacher than my prof for explaining these things. he just always get angry when we dont understand something clearly because he uses a lot of complex explanation and he expects us to be the top students just because we enrolled in this course. Thank you for making these videos. i will gladly finish this before another semester comes.
Thanks for the explanation!!! I would like to ask, if the input is n, the n^2 is the worst case scenario that the computer will have to take that much steps to sort right?
4:40 i needed that
Hi Caleb, I just wanted to let you know how amazing you are at explaining !!! Honestly, I am understanding more from you than all the places I have looked for explanations in the past year! You are amazing, please keep doing videos, may God bless you!!!
Omg good to see your face ! You're my favorite tutor online. Thank you all the knowledge you share. It is much appreciated 👍🏽
.
@@samuelhafer7516 .
He is a beautiful teacher! Every student deserves a teacher like that.
Finally I understood Logarithmic Time Complexity and Quadratic Time Complexity. Thanks. 👍
Why am I not seeing these kinds of people teaching at Universities? Had to take Data Structure & Algorithm twice in College and still not clear until I started watching your vids. Thank you!!!
this video is the reason I was able to get some of my answers right on an exam, thank you so much for posting, you are very good at explaining things
Finally understood log of n in a comprehensive way! Thanks Caleb!
I'm really glad you explained how logarithms work lol. I was just about to look up another video to explain it to me when you did it, so thanks. You shouldn't feel embarrassed.
4min in, I’m already loving this video, thanks. Your points are made loud and clear.
Wow how i wish this vid was available during my computer science journey.
The journey’s never over 😉
your videos are so useful! you're a great teacher, thank you so much!
Man, honestly, I think you provide the best quality explanations.
Amazing explantation. Thanks caleb!
you are more of a good teacher than my prof for explaining these things. he just always get angry when we dont understand something clearly because he uses a lot of complex explanation and he expects us to be the top students just because we enrolled in this course. Thank you for making these videos. i will gladly finish this before another semester comes.
Appreciate these videos man! Thank you for taking the time to create them
Loving this simple algorithms series 👍
@Tri-Right: I concur. And 👋💨, EC!!
You are awesome man ! I finally understood algorithms!
Me too.
The best channel in the world!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Keep it going. You doing great!
i so wanted your videos on data structures, thanks for starting this series
you're really amazing Caleb, you're really good at explaining. Thanks a lot for your videos.
Thanks for the explanation!!! I would like to ask, if the input is n, the n^2 is the worst case scenario that the computer will have to take that much steps to sort right?
Nicely covered 👍
very helpful, idk before. you are the best teacher instead of in my college 😂❤️
Wow thanks! You're amazing!
A million thank you's to you sir.
Thank you so much!
your tutorials are so clear, fell I learn O(logN) faster
love this video! thanks a lot!!
اجمل شرح🥰😍❤
UNDERATED!
just for reassurance, is O(n^2) is somehow like (in C)
for (i=0; i
Thanks a lot. 👍
for(int i=0;i
Beautiful!
thanks a lot
so good!
4:20 is it not supposed to be 5 operations if you include the last one where it has to check the last data that is left?
Yes, the correct formula is 1+ log-2(N) = x
Please do a video on merge sort
What's the outro song?
As you mentioned I am waiting for different sorting algorithms (implementation too pls.... any language will do but java or C will be good)
man i dont know why you make gard stuff soo simple
what if the given data is not an even number so its not have a middle number???
Nice video and very helpful. So what's the best algorithm to sort an array of numbers instead of n^x
Why can't a computer check every element in any data structure at once?
Now things starts to be more intresting
I wanna know how to perform the n square as program though 🙄
Someone get him a whiteboard please 😁
So what would you actually use the n² algorithm for??? Seems so slow. Lol
Easy
You need to get an eraser bro!
😍😍😍
Caleb make code breakthrough free , I don't have Credit card.
These videos are helping a lot but these ads are too much man. I literally got 4 ads for this 11 min video...
Wow you still have ur same voice sinde 2013
hey qt
lol
nice skin colour bro
We do want your wife to love you🤣
Keep it going. You doing great!