(2021-05-15) this video is seriously underrated, so far (271 likes only) These guys make 1st class teaching, these 2 videos of total of 2 hours worth weeks of academic teaching! Keep up this great work guys!
@tangobee
2 жыл бұрын
Yes, in fact this is the only video from where I learned Big O notation. I tried 10+ videos but none of the videos helped me. Thank you really.... ❤
@jay_wright_thats_right
3 ай бұрын
LOL, you really wasted your time talking about this like you're the KZitem police. LMAO!
@louisecrowe4968
3 жыл бұрын
Thank you so much Alvin - that is a fantastic explanation!! So clear and engaging :)
@xerxius5446
3 жыл бұрын
This is better than most of the paid courses. Amazing Work Alvin !
@jeaninepalicte
3 жыл бұрын
Very clear explanations and crisp video quality! Thanks Alvin ✊
@CoderbyteDevelopers
3 жыл бұрын
Thank you!
@hnyuhiv
Жыл бұрын
Alvin is really good at explaining concepts that I struggled to understand for a long time, thank you to him and Coderbyte for making this video possible!
@FirdausHSalim
2 жыл бұрын
No day have I ever understood BIG Oh this FAST. Thank you so much for this.
@jamie6441
2 жыл бұрын
I've known about Big O for a long time and I've just sort of known tips and tricks on why something is o(n^2) double loops! etc. But I've been looking for how to really understand this topic and a lot of other videos kind of just breeze by this. This really broke it down and really taught why a run time is a runtime. Thank you so much best video i've seen on this!
@madver
2 жыл бұрын
I must say that it makes me so happy and I feel fortunate if I find any topic by Alvin! He is the best teacher out here on internet! I wish he could cover design and architectural patterns as well.
@deanoneill4696
Жыл бұрын
Best video on Big O I have seen on KZitem. Thanks.
@gknt7234
Жыл бұрын
This is literally amazing. For the first time, I understand what it is and how to calculate it. Thank you Coderbyte!
@elidc93
Жыл бұрын
Hi thank you for this tutorial!!! I rarely I comment on video tutorials such as this, but I can't thank you enough because you helped me finally understand complex ideas (in my opinion) such as Big O notation. Thank you again for explaining it to an understandable level. I CLICKED THE LIKE BUTTON N TIMES, where N is an odd number hahaha
@simpleisbetter2779
2 жыл бұрын
by far the best video to understand Big-O
@alonzathompson9033
3 жыл бұрын
One of the best videos I have seen on BIG O
@Eric-bc1nt
3 жыл бұрын
love this video, simple examples with mixing usages of different important JS paradigms to explain Big-O
@btsbloodsweatandtears4021
2 жыл бұрын
Thank you and thank you again I was soooo lost but this video really help me. As a first gen who has no one to help them in college thank youuu soooo much
@KayVirals
3 жыл бұрын
I doubt if there Is a better practical explaination to this concept on internet ;) Thanks a lot for your efforts and time @Alvin
@shehrozirfan27
3 жыл бұрын
Excellent Explanation. Thanks.
@ContactmeTHERADBARD101
Жыл бұрын
This video was what I needed all along
@arielfranco8251
3 жыл бұрын
Just brilliant explanation. Thanks
@programer9620
2 жыл бұрын
It's really beautiful , neat & clean video. Thanks brother for such an amazing video. God bless you.
@augustocbx
3 жыл бұрын
Great! Very clear and objective. Thanks
@hazelcaling
Жыл бұрын
The best explanation! Thank you Alvin!
@EwertonSilveiraAuckland
2 жыл бұрын
Amazing... simple and easy to understand. Thanks
@TheRn35
3 жыл бұрын
You're natural at teaching!
@dnm9931
2 жыл бұрын
Thank you so much Alvin. You broke it down well.
@startover305
2 жыл бұрын
Excellent video! 'would love to know more about how to optimize the algorithms
@dembasiby
3 жыл бұрын
This is great. Thank you so much!
@manto7
3 жыл бұрын
Coming directly to this video after watching your video on freecodecamp... Love you bro
@CoderbyteDevelopers
3 жыл бұрын
thanks for watching! -Alvin
@manto7
3 жыл бұрын
@@CoderbyteDevelopers the way you explain the algorithm is really nice... Hoping to see more content from you. Stay blessed 💕. Peace
@pjmiravalle
3 жыл бұрын
This was fantastic Alvin, thank you!
@ms.r1611
2 жыл бұрын
Question: what will this time analysis be then if you use the array as an input for your Set constructor e.g. let mySet = new Set(arr); instead of using the loop to add elements.
@133839297
2 жыл бұрын
Such a great teacher!
@yagiro
9 ай бұрын
Great video! You really explain nicely the basic intuition for this subject. However, regarding the "uniqueOnly" solution, I think that the action of adding an item to a hashed set (in reference to the set.add line) cannot be counted as constant time. I will check on that and may update here later.
@trainedtotroll9385
2 жыл бұрын
Good work on the video. Keep it up! I’ve subscribed.
@wolfgang999
Жыл бұрын
amazing explanation !! keep up the good work :D
@fredirecko
2 жыл бұрын
Alvin, you rock
@elmaaegeansea
2 жыл бұрын
Thank you so so very much Alvin!
@naumanzafar7922
2 жыл бұрын
Very informative and learnt a lot. Thanks
@omaralhussari6607
2 жыл бұрын
Thank you very much for this video!
@carlosdelgado5632
2 жыл бұрын
Great video and explanation
@AbdelhameedG
3 жыл бұрын
Great Explanation , I really mean it.
@Feedv6
3 ай бұрын
You're my saviur 🙏
@manomay7029
2 жыл бұрын
Thanks a lot, Coderbyte!
@Viralvlogvideos
3 жыл бұрын
Please make whole competitive programming tutorials
@MouseCodes
2 жыл бұрын
Very informative, keep it up.
@singhyuvraj122
Жыл бұрын
🎯 explanation 👍🔥❤️🙏
@eddydecolombia
3 жыл бұрын
Wow, Such a GREAT Video, so comprehensive, Subscribed, liked, what else do you want?
@karanraiyani6796
3 жыл бұрын
Great Explanation. Learned a lot from this video. Thank you coderbyte
@kaanunsel
2 жыл бұрын
How does the "set" controls if the number is already in the list? Doesn't it have to iterate the new list in every loop? If it does, then why didn't we include that to our time complexity like we did for "include" method ?
@boredprogrammer6085
2 жыл бұрын
Awesome explanation, subbed to you
@ayberkmogol
2 жыл бұрын
very fckn well explained, Thx
@dnm9931
2 жыл бұрын
Anyone know why at 37:12 , he counts turning the set into an array as an additional n time??
@Gthefray
3 жыл бұрын
Thank you!!
@davidpocsai3419
3 жыл бұрын
const unique = (arr) => Array.from(new Set(arr)); is this simpler solution correct? or am i missing something. Would it change the time complexity at all?
@-0-__-0-
Жыл бұрын
What if its something like, const unique = (array) => { return Array.from(new Set(array)); } It's still O(n) from the Array.from() method right? But, Is it any better than the 37:37? considering that the set was initialized with the value of the array? Anyways, awesome video man I'm gonna watch part 2 now.
@cuuy
2 жыл бұрын
37:55 Can we assume that when we add an element to a set (onlyUniques.add(ele)), the method checks if the element is already in the set? That would mean that add isn't constant, but a linear operation, then we would also have a time complexity of O(n²). edit: I just continued the video and saw that the function using set is obviously much faster. And I just googled, it seems that add (and has) method is quite fast, the complexity should be sublinear according to the specification, though I don't know if O(1) is guaranteed.
@janus14cp
2 жыл бұрын
Sets use hash mapping, so adding, checking, deleting, and retrieving are all constant time operations
@illuminatelair8084
3 жыл бұрын
good explanation
@candi2Love
3 жыл бұрын
*PLEASE ZOOM in on the code in the editor or INCREASE the font size.*
@abhishekgoel2896
3 жыл бұрын
would you recommend for beginners
@divyambhutani6229
3 жыл бұрын
In the last question in the video why you took the time complexity of insertion and access in hashmap as O(1). Is it not O(n) in worst case??
@ythalorossy
2 жыл бұрын
Because using hashing the address/index where the values where the store is calculated always in the same time.
@sanjaypaudel3296
2 жыл бұрын
wow sir
@AlexisFaria
3 жыл бұрын
What’s the name of that thing you used for coding JavaScript in 34:48
@ythalorossy
2 жыл бұрын
Probably he is using a terminal with Node Installed on the machine.
@djohn0909
3 жыл бұрын
Are you still uploading???
@diesomemore
Жыл бұрын
How do I run the terminal in javascript. im on windows
@diesomemore
Жыл бұрын
nvm
@oskrm
3 жыл бұрын
Any new videos coming up?
@jordanolson11
3 жыл бұрын
10:54 why can you drop "the constant" in O(4 * n) to be O(n)? I don't get why you can just drop a number just because it is a constant, maybe it's something I missed in math and someone can help me wrap my head around?
@ErichCervantez
3 жыл бұрын
In the case of Big O notation, the only concern is impact the input size has on the algorithm. As "n" increases, O(n) moves linearly along the time complexity graph at the same angle as O(4 * n), in which case to simplify you can just drop the constants and call it O(n). At least this is my understanding. Like most algebraic equations, you can simplify. Big O just has its own unique way of simplification.
@JimBob1937
3 жыл бұрын
If you had some calculus it might be more intuitive as it is similar to taking a limit of something. The largest impactful aspect of the calculated Big O is sort of like the limit. If you have two algorithms that grow at O(4n) and O(2n), as n grows larger and larger, the difference between those two algorithms shrink to the point of not being very meaningful. It still have an impact (algo 1 is twice of 2 in terms of complexity), it's just that it isn't meaningful to the purpose of Big O, which is how the RATE of complexity grows with the input, in these cases the rate of complexity growth is the same for all intents and purposes since the constant has such a little impact as n approach infinite. If n increases, both 1 and 2 increase at the same rate, at n rate. If you have O(4n^2) and O(2n^2), the rate of increase is overwhelmingly that of n^2, the difference of the 2 and 4 constants is not meaningful to the rate of growth.
@shubhamss3328
3 жыл бұрын
thanks a lot, know your channel from fcc....olease do one on binary trees
@CoderbyteDevelopers
3 жыл бұрын
We do have some content on binary trees! You'll want to check out our videos on the channel page: kzitem.info/news/bejne/xZyXsXeog2R5dKA -Alvin
@panick.attack
Жыл бұрын
I wish Alvin was my professor in college.
@Dani-code3
Ай бұрын
:) por favor que lo traduzcan a español
@tech-n-data
2 жыл бұрын
Your list is out of order, 1 and 2 need to be switched. Thank you for these videos.
@passamaquoddy8311
3 жыл бұрын
Horrible presentation...
@wagnermoreira786
3 жыл бұрын
23:50 why is this not O(n) instead of O(1) ? the numbers array can be N, meaning it could have a million numbers right? what am I missing? @CoderByte
@gokulsrinath7714
3 жыл бұрын
we are looking only on space complexity, So no matter what the size of the input be, the code simply initializes space only two times ( i.e. let sum=0 & let i=0) when method is called and so O(1+1) => O(2) => O(1).
Пікірлер: 86