Wow! Been learning your beginner programming course but stopped because I can't follow on the big o notation part and been searching to learn more about it. You posted about it when I exactly needed it, thank you so much ! You guys are such a lifesaver!
Simply amazing visualizations! A great teacher is able to break down complex topics, and visualize them intuitively, summarizing without removing any of the details, indeed making the details easier to understand.
Allah! La ilaha illa Huwa (none has the right to be worshipped but He), the Ever Living, the One Who sustains and protects all that exists. Neither slumber, nor sleep overtake Him. To Him belongs whatever is in the heavens and whatever is on earth. Who is he that can intercede with Him except with His Permission? He knows what happens to them (His creatures) in this world, and what will happen to them in the Hereafter. And they will never compass anything of His Knowledge except that which He wills. His Kursi extends over the heavens and the earth, and He feels no fatigue in guarding and preserving them. And He is the Most High, the Most Great. [This Verse 2:255 is called Ayatul-Kursi.] [Surah al-Baqarah 2: 255]
Thank you for clearing the Big O notation concept in this video. I searched everywhere to learn that concept but didn't find any. So, when I came to know about this video, I'm extremely proud of myself for choosing this one. It has cleared all my concepts related to Big O and space complexity.
La mejor explicación sobre notación asintótica que he visto. Muchísimas gracias por haberte tomado el tiempo para hacerlo. Has demostrado un extraordinario nivel pedagógico que muchos de los que fueron mis profesores desearían tener... The best explanation of asymptotic notation I have ever seen. Thank you so much for taking the time to make this. You have demonstrated an extraordinary pedagogical level that many of my former professors would like to have...
3 years and this is still ridiculously helpful! This video is a guide on how youtube videos should be executed, that no matter the age the video is still relevant
I've looked at so many videos trying to find a person who explained it easiest and quickly and somehow the nearly 2 hour long video is the only one that did both of those
This is pure gold 🤩 thanks for making such amazing content. Initial i did not expect to stay till end of the video but boy oo boy the content quality is so good that it kept me hooked. Love you guys 🤩
1:15:30 - (i) Actually in the merge function (helper for mergeSort), you can exit the while loop earlier, instead of using &&, you can use || (OR) instead because you are presuming to use two sorted arrays as the function arguments anyway (otherwise, the two-way merge will not work). What that means is, if any one of these arrays are already part of the final merged Array (i.e. we have traversed through at least one of the two arrays, that means we can simply concat the other array which still has elements not added to the merged Array, to the end of it, without any further thought). (ii) The concat method can be used like this instead of two concats. ``` const merge = (arr1, arr2) => { let i = 0; let j = 0; const mergedArr = []; while (i < arr1.length || j < arr2.length) { if (arr1[i] < arr2[j]) mergedArr.push(arr1[i++]); else mergedArr.push(arr2[j++]); } return mergedArr.concat(arr1.slice(i), arr2.slice(j)); }; ```
At 1:05:40, you don't need to specify the last element of an array in the slice function. Leaving the second argument blank will do the trick, as specifying only one argument in slice goes to the end of an array by default.
Great explanations and examples with good drawings. It is highly under appreciated when you take the time and effort to make your handwriting legible and use a consistent color pattern when explaining examples. This really makes a big difference visually in understanding the parts. Thank you so very much!
I tried books, articles and other videos that tried to explain Big O Notation and all of them left me more confused and frustrated after seeing them than before I started. As all the other commentators have said, "Well done". A brilliantly simple visual and clear explanation. You are a great teacher! 😃👍 I understand it now but I will watch this again a few times to get the code examples in my brain.
sir you have a potential to become a great tutor - the way you break down a complex topics into a simple one. - Clean visualization . - Detailed explanation. keep it up the great work
Allah! La ilaha illa Huwa (none has the right to be worshipped but He), the Ever Living, the One Who sustains and protects all that exists. Neither slumber, nor sleep overtake Him. To Him belongs whatever is in the heavens and whatever is on earth. Who is he that can intercede with Him except with His Permission? He knows what happens to them (His creatures) in this world, and what will happen to them in the Hereafter. And they will never compass anything of His Knowledge except that which He wills. His Kursi extends over the heavens and the earth, and He feels no fatigue in guarding and preserving them. And He is the Most High, the Most Great. [This Verse 2:255 is called Ayatul-Kursi.] [Surah al-Baqarah 2: 255]
This has been one of the most helpful videos I've seen since I started self-learning. Not only do you explain time complexity in bite-sized bits, but you also explain frequently used algorithms and their everyday applications! Thank you!
1:20:13 actually thought that was my stomach while in the library and looked to see if I had disturbed people! great video, awesome you should lecture at my Uni way more students would get you than the lecturer!👍
your explanation is : so elegant... so beautiful .. just looking like wow !! 😍 ...Please please cover more videos on space complexity & few more common mistakes and trade offs
Step by step explanations made me to understand Time complexity much better than many other TH-cam tutorials. Kindly feedback, why space complexity not explained much ?
I love how you detailed the deep dive part of merge array. I'm a python beginner and I'm not good at recursive prgoraming, this video helps me alot, thank you❤
EDIT: n^2 means n squared. Here is a better explanation for O(n^2) for anyone who didn't understand the one in the video. For loop is a O(n) operation. A for loop inside a for loop is also a O(n) operation. The inner loop iterates as many times as the other loop iterates, so n*n, which is O(n*n). And n*n = n^2. EDIT 2: n^3 is just n*n*n
This is a great video. I'll say for those who don't have at least an engineering math background that studying some matrix algebra and calculus without the trigonometry (however trig is fun!), might be helpful for intuition. Also it can open doors otherwise left closed for programming jobs.
Wow! Been learning your beginner programming course but stopped because I can't follow on the big o notation part and been searching to learn more about it. You posted about it when I exactly needed it, thank you so much ! You guys are such a lifesaver!
Dutch! You better to have a Plan.
Quite possibly the best explanation of Big O that I have come across on the web period!
Simply amazing visualizations! A great teacher is able to break down complex topics, and visualize them intuitively, summarizing without removing any of the details, indeed making the details easier to understand.
Allah! La ilaha illa Huwa (none has the right to be worshipped but He), the Ever Living, the One Who sustains and protects all that exists. Neither slumber, nor sleep overtake Him. To Him belongs whatever is in the heavens and whatever is on earth. Who is he that can intercede with Him except with His Permission? He knows what happens to them (His creatures) in this world, and what will happen to them in the Hereafter. And they will never compass anything of His Knowledge except that which He wills. His Kursi extends over the heavens and the earth, and He feels no fatigue in guarding and preserving them. And He is the Most High, the Most Great. [This Verse 2:255 is called Ayatul-Kursi.]
[Surah al-Baqarah 2: 255]
You dont know how much i wanted this course
thank you so much Free Code Camp
you really deserve a lot of praise
Thank you for clearing the Big O notation concept in this video. I searched everywhere to learn that concept but didn't find any. So, when I came to know about this video, I'm extremely proud of myself for choosing this one. It has cleared all my concepts related to Big O and space complexity.
the sound at 1:20:12 it got me cracking up lol.
an amazing straightforward tutorial, thanks a lot!
just experienced it also!
My man's hungry lol. Need some break :)
Two hours well spent!!!
Amazing course, Clear and Concise Explanation of each topic. Thank you so much for making this video.
This channel is killing it it's like Top 1% of the content Thank you so much
La mejor explicación sobre notación asintótica que he visto. Muchísimas gracias por haberte tomado el tiempo para hacerlo. Has demostrado un extraordinario nivel pedagógico que muchos de los que fueron mis profesores desearían tener...
The best explanation of asymptotic notation I have ever seen. Thank you so much for taking the time to make this. You have demonstrated an extraordinary pedagogical level that many of my former professors would like to have...
3 years and this is still ridiculously helpful! This video is a guide on how youtube videos should be executed, that no matter the age the video is still relevant
That is the best explanation about Big O notation I have ever seen 🤯
Christ pls give me the attention span to get through this course. Amen
The hand drawing behind the screen doesn't help with that! Please stop using that it's distracting af!
Divide and conquer
I refuse to like this comment because it has 69 likes. I pray everyone does the same🙂
AMEN 🙏❤️🙏
meeeeee tooooooooooooooooooooo
This is what I'm currently learning in college and needed someone to break it down for me. Thanks 👍
It's like you guys can read my mind to know just what I'm searching for
Ikr
Those "Big O notation in 10mins" videos were NOT cutting it for me. Thank you soo much!
Trust me this is the best video for understanding O notation I have ever watched.
I've looked at so many videos trying to find a person who explained it easiest and quickly and somehow the nearly 2 hour long video is the only one that did both of those
This is the best Big O Notation video I have ever seen.
Had to rewind at 1:20:15 to make sure it wasn't my stomach grumbling lol.. Great video super informative!!
This is pure gold 🤩 thanks for making such amazing content. Initial i did not expect to stay till end of the video but boy oo boy the content quality is so good that it kept me hooked.
Love you guys 🤩
1:15:30 -
(i) Actually in the merge function (helper for mergeSort), you can exit the while loop earlier, instead of using &&, you can use || (OR) instead because you are presuming to use two sorted arrays as the function arguments anyway (otherwise, the two-way merge will not work). What that means is, if any one of these arrays are already part of the final merged Array (i.e. we have traversed through at least one of the two arrays, that means we can simply concat the other array which still has elements not added to the merged Array, to the end of it, without any further thought).
(ii) The concat method can be used like this instead of two concats.
```
const merge = (arr1, arr2) => {
let i = 0;
let j = 0;
const mergedArr = [];
while (i < arr1.length || j < arr2.length) {
if (arr1[i] < arr2[j]) mergedArr.push(arr1[i++]);
else mergedArr.push(arr2[j++]);
}
return mergedArr.concat(arr1.slice(i), arr2.slice(j));
};
```
If you use OR you can get out of range for one of the arrays.
What language are you using ?
I have seen a lot of different stuff but this one is the best! 2 hours well invested. Bravo and thank you for these crystal clear explanations!
You make it so easy, best channel in TH-cam man
This is the best video on time complexity on TH-cam, period. 😀
Thanks!
This is the best big o notation course. Everything is explained very well. Thanks.
THANK YOU.
been wanting a video on this for a while
Great explanation! So far this has been the easiest out of my 3 days of journey in just understanding the meaning of big o notation
This is gold, you made Big O easy to understand
This is the best video i have found so far for understanding big O notations! Thank you.
At 1:05:40, you don't need to specify the last element of an array in the slice function. Leaving the second argument blank will do the trick, as specifying only one argument in slice goes to the end of an array by default.
Studying for my computer science midterm. Great video helped me a lot!
Studying this for my national Olympiad ☠
i have been struggling so much on understanding this topic, and this video discussed it at the perfect pace! thank you!
Thanks!
Great explanations and examples with good drawings. It is highly under appreciated when you take the time and effort to make your handwriting legible and use a consistent color pattern when explaining examples. This really makes a big difference visually in understanding the parts. Thank you so very much!
One of the videos with a high quality explanation.
I tried books, articles and other videos that tried to explain Big O Notation and all of them left me more confused and frustrated after seeing them than before I started. As all the other commentators have said, "Well done". A brilliantly simple visual and clear explanation. You are a great teacher! 😃👍 I understand it now but I will watch this again a few times to get the code examples in my brain.
Nothing was glossed over. Everything was explained so well. Great job man!!
Video is good because of the content and the implementation in javascript makes it even better.
sir you have a potential to become a great tutor
- the way you break down a complex topics into a simple one.
- Clean visualization .
- Detailed explanation.
keep it up the great work
Allah! La ilaha illa Huwa (none has the right to be worshipped but He), the Ever Living, the One Who sustains and protects all that exists. Neither slumber, nor sleep overtake Him. To Him belongs whatever is in the heavens and whatever is on earth. Who is he that can intercede with Him except with His Permission? He knows what happens to them (His creatures) in this world, and what will happen to them in the Hereafter. And they will never compass anything of His Knowledge except that which He wills. His Kursi extends over the heavens and the earth, and He feels no fatigue in guarding and preserving them. And He is the Most High, the Most Great. [This Verse 2:255 is called Ayatul-Kursi.]
[Surah al-Baqarah 2: 255]
Awesome video that really helped me to learn Big O and understand it better. Thank you selikpro!!
Wish I had this source available 3 yrs ago. This is taught so well I had to watch it!
Must say that thats the best tutorial related to the subject!!!
well, this video achieved what a degree and other courses couldn't. thankyou :-)
This has been one of the most helpful videos I've seen since I started self-learning. Not only do you explain time complexity in bite-sized bits, but you also explain frequently used algorithms and their everyday applications! Thank you!
best 2 hours i have spent on any course at all now i can say i understand the Big O notation
wow! i'm so blessed, thanks for the course i now understand what Big O notation is!
This is the one video that finally helped me to understand big O
Long time awaited!
This is the most amazing tutorial on big o notation! Thank you!
Thank you very much Giorgio thompson! Easily the best video explaining big 0 notation in my opinion
the best O notation tutorial !!!!!!!!!!!!
🐐🐐🐐Amazing video, don’t hesitate to make more
1:20:13 actually thought that was my stomach while in the library and looked to see if I had disturbed people! great video, awesome you should lecture at my Uni way more students would get you than the lecturer!👍
Thought it was my stomach too 😂
This video ease up my brain on Big O notation. The video is good. Thank you.
This is what I was waiting for. Thank you.
Best course for big O notation ever
your explanation is : so elegant... so beautiful .. just looking like wow !! 😍 ...Please please cover more videos on space complexity & few more common mistakes and trade offs
27:44 He drew us as a crippled dude and him as a caregiver lmao
This is a clear explanation of Big O.
Thank you
Such a precise description of each time complexity and well organized. Ty so much!
Step by step explanations made me to understand Time complexity much better than many other TH-cam tutorials. Kindly feedback, why space complexity not explained much ?
Thank you so much! This video is definitely a teaching masterclass. Great stuff!
thanks,just love for your work and collabs!
the thumbnail was sick !!!!
Very good and clear explanation, sorted many of the questions I had in mind. Thanks.
You are a really good teacher!!! many thanks!!!
First time I really understand what is Big O notation !!! as a CS student
I love how you detailed the deep dive part of merge array. I'm a python beginner and I'm not good at recursive prgoraming, this video helps me alot, thank you❤
I wish Such kinds of youtube courses were available during my college days. But till now my learning appetite is increasing exponentially.
Man seriously I was thinking about this today only that how hard it is and your came like a magic
What a great explaination. Thanks a lot man. Im loving it.
Nice. The illustrations made understanding the big-O concept very easy. Thank you.
Fantastic course, with amazing examples. Simple objective, now I can study better algorithms. Thank you very much!
Best explaining I have seen
EDIT: n^2 means n squared.
Here is a better explanation for O(n^2) for anyone who didn't understand the one in the video. For loop is a O(n) operation. A for loop inside a for loop is also a O(n) operation. The inner loop iterates as many times as the other loop iterates, so n*n, which is O(n*n). And n*n = n^2.
EDIT 2: n^3 is just n*n*n
I’m curious about what made you think this was a better explanation. To me, it’s just another explanation.
@@samuelodan2376 A different perspective can be a much better perspective depending on the person observing it.
@@BusinessWolf1 hmmm 🤔
Didn't see it this way till now
Thanks ☺️👍
@@BusinessWolf1 that means there’s potential for it to be a better explanation, not that it already is, right?
could you explain the log one? to me it amounted to "it's log because it's log, now you understand!"
Best explanation for time complexity calculation. Thanks!
WOW THANK YOU SO MUCH, Time complexity is so easy to understand now!
Awesome tutorial !!!
Insanely simple and precise
Such a nice guy and i loved this tutorial so much , it's so different
Yes thank you i've been waiting for this
Thanks for the video, greetings from Argentina!
Thanks for the lecture! I now have a good grasp on this topic.
This guy really did a great job... Thanks so much for this
Great simplifications and visualizations ! Good job man . Thanks a lot.
OMG i'm studying it on school and u guys help me so much
I am really becoming a great fan of this coding camp
dropping right videos right during interview season. great!!!!
Thank you so much for this video! Desperately needed it!
What a tactile video lol, the keystrokes added a strange ASMR element to the learning experience :p Didn't know I was into it until now!
great video , love from india
the 0(log n ) example at 30:34 cause a stack overflow. the correct way to implement. function log(n) {
if (n
Beautiful explanation.
had been struggling a lot , have seen many of videos but now i am cursing myself why the hell i did not land here first time.
Great video. Thanks! Took awhile but well worth it.
Wow! Amazing explanation.
This is a great video. I'll say for those who don't have at least an engineering math background that studying some matrix algebra and calculus without the trigonometry (however trig is fun!), might be helpful for intuition. Also it can open doors otherwise left closed for programming jobs.
Thank you again, and again! These are wonderful explanations
Thanks for the in depth explanation
Great video explaining it. Very easy to understand from the visual examples.