I'd say as a teacher he has the tendency of all talented ppl in their fields and has a little trouble relating to the noob, but comparing these lectures to the ones on the same topics in uni--pretty fascinating. Primeagen is a worse teacher but an overall much more interesting speaker. X factor.
Describing big O as ‘categorisation’ is simultaneously so obvious and so immensely helpful. I’m going to use that when explaining it to others, thank you.
edit: I might not like all his content but this guy among a few others probably inspired a generation worth of people to try programming. Also: vanilla i3, so based
If Will Sentance did an algorithms course, it would be 🔥. Prime's bubble sort lecture probably could have been smoother. But, I'm sure it'll pick up after that.
@@zwillx3953while his method of explaining is a bit confusing, it actually works because here he is using i to keep track of the sorted element and j and j+1 are doing the comparison and swap. So, when i = 0, you go into the inner loop of j and compare that first element with every subsequent element and keep bubbling the higher value to the end. Then i increments by 1 which takes the sorted element at the end of the array out of the comparison and swap being done in the inner j loop since that is already sorted from the previous iteration and again you go into the inner j loop and do the comparison and swap all the way through bubbling the higher value to the end. This continues till you satisfy the condition of the outer i loop. Hope it makes sense. Best thing is to write it down with a sample unsorted array of numbers and manually walk through the algorithm and writing the new array at each step. You will understand it better that way.
I love that he is cursed with his coding speed. "You just have to write it * Proceeds to do his vim magic * Talking to a class of students; "Alright hopefully you've written that down" No.. Not everyone is a vim ninja xD
You can actually use javascript maps to lookup something unique by the object reference. Just set the key to the object in question, and the unique value to the value
I have a question on the the video 'Implementing Two Crystal Balls.' If we do sqrt(n), it seems like there will be instances where we fail to find it? For example, 1-1000 floors. Then we try at 100 and it breaks. With 1 crystal we do 1-100. Then we try at 10 and it breaks. Now we have 1-10 that we are not sure of. Will this invalidate the whole idea?
Saying that Big Oh is a way to categorize programs is probably quite useful for programmers. Might be worth noting that it’s a quite simple mathematical concept defined in terms of a limit. It’s very useful for describing asymptotic behavior of functions generally, not just in programming.
Just started programming. The amount of content I had to research to understand this lecture took me over an hour of reading and another hour of messing around in the editor to feel comfortable. Still don't get why .hasOwnProperty does not satisfy the consistent hash argument, but the lessons I've learned from rewatching this a couple times have me asking a lot of questions about everything I write now.
Right on "queue" TH-cam algorithm... 😅 I have been watching a lot of his videos as I'm learning to program in hopes that I'll slowly start understanding wth he's talking about and now I can learn it directly from him..
Watching his videos for so long where he's joking and yelling so much, and then hearing him dead serious, is the best way to show what cognitive dissonance feels like
I just finished the course, pretty nice and short. Although I had a similar course in collage, we didn't delve into few things like heaps and hash maps.
It would be great if portions of each video were available even if it was 1-3 minutes of each. The reason I say this is because I usually use that as my "floober doober" test to see whether the video will be cohesive, I'll be able to follow it, or if it will be floober doober material. I expect Prima to have pristine content, but I also don't know if I'd be able to digest that content. Most sites offer a free trial but really what I'm looking to do is see how much of Frontend Masters would stick if I subscribed.
Uhh, this is not the “last you’ll ever need” it’s more like a basic introduction where several followup lessons would be needed to actually be good at algorithms. Given prime’s seniority level, the name of the channel and the name of the course, I actually expected this to be an advanced course. They should rename this video to “introduction to data structures and algorithms” and I wouldn’t have a word of criticism.
I would barely even call this an introduction, this is more like a small bite size sample of an introduction to basic algorithms and data structures. I'm sure the title generated a lot of clicks tho lol.
whoa, actually registered and this is sick. I love how you made fun of javascript in the beginning of the video because I am a new learner and java paladin.
As a level 1 java paladin these videos do not disappoint. All the subtle jabs at javascript muwahaha. I never thought Id be marathoning videos on datastructures FOR FUN but here I am. Thank you
About the second example of O(n) with the two loops, aren't those optimised by the compiler and essentially run together, so from an execution pov that is O(n) anyway?
No because time complexity isn't about concrete implementation. You purely look at it in terms of pseudocode, and count the "steps". He's actually making it more confusing by using real code, so you asked a fair question. It's also worth noting that big O refers to the maximum growth. Eg "grows no faster than, or worst case". Theres also big omega: "grows no slower than, or best case" and big theta The whole thing is kinda explained poorly. It's really not much different to describing the growth rate of math functions. The O part just means "upper bound of"
Don't JS object actually have a unique id? I mean, they don't have it explicitely defined but it's the reason why you can't compare the same objects. E.g. let a = { name: "" } let b = { name: "" } let c = a a == b is false but a == c is true because it looks at their references in memory.
objects are created as instances of a class or constructor function, each object is assigned a *reference* to a memory location where its properties and methods are stored // in JS this is a pointer that stores the memory address (with abstraction)
![[LIVE] : ONE ลุมพินี 80 | คู่เอก "รักษ์ vs ยอดนำชัย"](http://i.ytimg.com/vi/ckLMRorsMeY/mqdefault.jpg)
It's a bit weird seeing him so calm and serious.
Right? I didn’t even recognize him in the intro
I wanna see a PrimeReacts to this video
But at times you can tell that he can't contain the chaotic engery :D:D
Primegen in some alternate universe
100% hahah
Prime is one of the most inspirational programmers I've ever had the privilege of interacting with.
I'd say as a teacher he has the tendency of all talented ppl in their fields and has a little trouble relating to the noob, but comparing these lectures to the ones on the same topics in uni--pretty fascinating. Primeagen is a worse teacher but an overall much more interesting speaker. X factor.
The longer the video goes, the closer he gets to his streaming persona!
Great instructor
I see ThePrimeagen in his hoodie but I hear Dr. Prime. He's the CS prof I wish I had.
Describing big O as ‘categorisation’ is simultaneously so obvious and so immensely helpful. I’m going to use that when explaining it to others, thank you.
Sounds like if the naughty kid had to give a corporate presentation.
1:48 He only knows performance. Opposite of performance is not in his vocabulary :D That's how we know him. Keep it up Prime!
Good one 🤣🤣
I kept thinking this is a meme and it's gonna go south at any point
😂
I love that he is staying true to himself and wears a hoodie.
i dont trust any coder who doesnt wear one ;d
Imagine if he taught classes the way he did with his streams 😆was crazy that I was hoping for that haha
"I teach on Windows!! I teach on Windows... Shut up!!"
Me too 🙂
It's still him, just a diluted version, I still love it.
Unfortunately not as joyfully unhinged as he typically is. It’s ludicrously informative and ThePrimeagen’s teaching style is great.
edit: I might not like all his content but this guy among a few others probably inspired a generation worth of people to try programming.
Also: vanilla i3, so based
Definitely inspired me to learn vim 2 years ago :D
vanilla i3 is unusable, gotta change those motions to vim keys
Oh snap I think this is the last algorithms course I will ever need!
Not even Neo could have learned this as blazingly fast as i just did!
Such a pleasure to listen to people who are great at what they do explain topics like this. 🤙🏼👍🏼
CHAD i3 user with neovim greatness
great to see prime in prime
I cannot believe you have this course up on your website for free
Big fan of prime and this preview sold it to me. Will be taking this course, thanks for sharing and thanks to prime for doing this
I feel this could use more coconut oil
Frontend Masters are the only ones who could control his chi
Its weird seeing prime so calm and well adjusted
This is real course right? I am confuse. He is very calm. The backgound music too.
Yes, it's a preview of his algorithm course on frontendmasters
I scanned ahead to see if they made him use VS Code for this 😂
As far as unique values in Javascript, isn't that what Symbols are for?
I think you could use a Symbol to store your own object ID. Good idea!
One minor problem is that this consumes memory. ☹
If Will Sentance did an algorithms course, it would be 🔥. Prime's bubble sort lecture probably could have been smoother. But, I'm sure it'll pick up after that.
Isn't it a mistake? He's checking j vs j not j vs i. Lol
@@zwillx3953while his method of explaining is a bit confusing, it actually works because here he is using i to keep track of the sorted element and j and j+1 are doing the comparison and swap. So, when i = 0, you go into the inner loop of j and compare that first element with every subsequent element and keep bubbling the higher value to the end. Then i increments by 1 which takes the sorted element at the end of the array out of the comparison and swap being done in the inner j loop since that is already sorted from the previous iteration and again you go into the inner j loop and do the comparison and swap all the way through bubbling the higher value to the end. This continues till you satisfy the condition of the outer i loop. Hope it makes sense. Best thing is to write it down with a sample unsorted array of numbers and manually walk through the algorithm and writing the new array at each step. You will understand it better that way.
@@zwillx3953can I please have your logins to the course…it’s quite expensive from my part of the world.
@zwillx3953 it's right. You probably mean selection sort
4:18 O(2N) and O(N) is the same, so it's wrong to say "It's not O(2N), it's not that at all".
But are any of those algorithms blazingly fast?
It is indeed the last one you'll need 🙏🔥. It's a really good course.
I love that he is cursed with his coding speed.
"You just have to write it
* Proceeds to do his vim magic *
Talking to a class of students;
"Alright hopefully you've written that down"
No.. Not everyone is a vim ninja xD
You know you’re only here because you’re interview prepping and know you’ll never actually need to code any of these algos, ever.
Loving the system 76 lappy running PopOS!
You can actually use javascript maps to lookup something unique by the object reference. Just set the key to the object in question, and the unique value to the value
Do you even work at NETFLIX? Yeah, didn't think so.
@@tourdesource what has that got to do with anything?
@@snivels It's a joke related to the instructor, not really worth explaining. No disrespect meant.
@@snivels You're absolutely right about map accepting objects as unique keys, btw.
@@tourdesource haha sorry, hard to read humour these days on the net. I see what you meant now, I'm reading what you said in Primeagen's voice 😂
noway! this will be incredible
I have a question on the the video 'Implementing Two Crystal Balls.'
If we do sqrt(n), it seems like there will be instances where we fail to find it?
For example, 1-1000 floors. Then we try at 100 and it breaks.
With 1 crystal we do 1-100. Then we try at 10 and it breaks.
Now we have 1-10 that we are not sure of. Will this invalidate the whole idea?
Prime would be the coolest teacher ever
He gives me the same feeling i get when I see my gta online character in a cutscene
this man... give this man a cookie!
Not even one mention of Juh-SON and JSML?
Still love the informative and entertaining video from the Prime himself!
JDSL FTW!!!11!
(NOT!) 🙂
This is what professional voice-over sounds like.
Saying that Big Oh is a way to categorize programs is probably quite useful for programmers.
Might be worth noting that it’s a quite simple mathematical concept defined in terms of a limit.
It’s very useful for describing asymptotic behavior of functions generally, not just in programming.
Just started programming. The amount of content I had to research to understand this lecture took me over an hour of reading and another hour of messing around in the editor to feel comfortable. Still don't get why .hasOwnProperty does not satisfy the consistent hash argument, but the lessons I've learned from rewatching this a couple times have me asking a lot of questions about everything I write now.
Right on "queue" TH-cam algorithm... 😅 I have been watching a lot of his videos as I'm learning to program in hopes that I'll slowly start understanding wth he's talking about and now I can learn it directly from him..
Cache locality enters the chat: now, forget everything you've just learned!
Cold hard cache rules the world.
I can't take him seriously without him flipping the hell out within 2-3 minutes of a video.
Prime should do all his videos like this.
This is AI, this man cannot spend 3 minutes without screaming.
OMG this is AWESOME. Thank you! BTW folks, at least of of today 3/27 this course is FREE?!
Yes it is!
Always wanted to study data structures from Dr.Disrespect
the fact he's so happy and calm is truly scary to me
Watching his videos for so long where he's joking and yelling so much, and then hearing him dead serious, is the best way to show what cognitive dissonance feels like
Alright. You sold me. I'll buy this course... for free. Thanks!
I just finished the course, pretty nice and short. Although I had a similar course in collage, we didn't delve into few things like heaps and hash maps.
It would be great if portions of each video were available even if it was 1-3 minutes of each. The reason I say this is because I usually use that as my "floober doober" test to see whether the video will be cohesive, I'll be able to follow it, or if it will be floober doober material. I expect Prima to have pristine content, but I also don't know if I'd be able to digest that content. Most sites offer a free trial but really what I'm looking to do is see how much of Frontend Masters would stick if I subscribed.
This course is free bro
So he didnt diss VS code?
Man this feels like he trolled us
Uhh, this is not the “last you’ll ever need” it’s more like a basic introduction where several followup lessons would be needed to actually be good at algorithms. Given prime’s seniority level, the name of the channel and the name of the course, I actually expected this to be an advanced course. They should rename this video to “introduction to data structures and algorithms” and I wouldn’t have a word of criticism.
I would barely even call this an introduction, this is more like a small bite size sample of an introduction to basic algorithms and data structures. I'm sure the title generated a lot of clicks tho lol.
*You guys do know this is just the first video of the full course right?*
Looks like a great course!
My boy Prime! Love it!
It is weird why he is so calm 😂
Is the course really for free?? Seems too good to be true!
Yep! The full course is here, and it is completely free forever! frontendmasters.com/courses/algorithms/? Only email is required.
@@FrontendMasters I signed up. Thanks a lot for this!
@@FrontendMasters Got this course a long while back, enjoyed it a lot. Thank you and Prime for putting out such a great course!
Kept waiting for.. “Gotem”!
For the bubble swap, can't you just do...
arr = arr.sort((a, b) => a - b);
You can, but he explains how the sort function is written.
What about dynamic programming? Shouldn't that be in an algorithms course?
Algo's are cool and all, but what keeb?
I got through 1/3 of this course in a day and then had a fried brain. 10/10
Yeah imma need this
wot. is this for real? great break down of big o and very smart to introduce that concept early.
whoa, actually registered and this is sick. I love how you made fun of javascript in the beginning of the video because I am a new learner and java paladin.
As a level 1 java paladin these videos do not disappoint. All the subtle jabs at javascript muwahaha. I never thought Id be marathoning videos on datastructures FOR FUN but here I am. Thank you
About the second example of O(n) with the two loops, aren't those optimised by the compiler and essentially run together, so from an execution pov that is O(n) anyway?
how are they optimized and run together? what if the input of one loop relies on the result of another loop?
No because time complexity isn't about concrete implementation. You purely look at it in terms of pseudocode, and count the "steps".
He's actually making it more confusing by using real code, so you asked a fair question.
It's also worth noting that big O refers to the maximum growth. Eg "grows no faster than, or worst case". Theres also big omega: "grows no slower than, or best case" and big theta
The whole thing is kinda explained poorly. It's really not much different to describing the growth rate of math functions. The O part just means "upper bound of"
What laptop is he using?
System 76
That intro scared me. Like frontend masters holding his family hostage 😅
"If you're in c++ you hack yourself" 6:13 LMAO
Where the full course
Wait, he works on Netflix??
You’re late😂
all i know is a for loop inside a for loop is very computationally expensive
Whats the keyboard he’s using?
My god, somebody please give Prime his Tankist helmet already!!!
So relatable
this is the last algorithms course I will need; I will need a lot more.
These are only the pure basics of algorithms.
The full course is on our website for free here frontendmasters.com/trial/
He works at Netflix btw
Do we get a certificate?
Good ol' Mikey Bubbles.
True story, I tried to post this joke a minute ago and it was so bad my laptop crashed.
buttery, coconut oily smooth intro
I think the maps thing broke my brain.
It's hash map. Which generates key with a predefined function
Where can you find the slides used in this course?
Everything is available on our website. This course is 100% free forever, only email is required: frontendmasters.com/courses/algorithms/
To be honest, I was expecting this video as prank .. still watching and expecting that, somewhere in the middle of the video something will happen :D
I love that he is wearing the hood of the hoodie lmao
Cover Knuth's Dancing links and I'll sign up
where's the coconut oil?
for the life of me I dont understand the hoodie fixation
Bro literally used personality no 5
Don't JS object actually have a unique id? I mean, they don't have it explicitely defined but it's the reason why you can't compare the same objects.
E.g.
let a = { name: "" }
let b = { name: "" }
let c = a
a == b is false but a == c is true because it looks at their references in memory.
objects are created as instances of a class or constructor function, each object is assigned a *reference* to a memory location where its properties and methods are stored // in JS this is a pointer that stores the memory address (with abstraction)
What language did you use in this course?
JavaScript/TypeScript
Does anyone know the software he uses for his xppen?
If only my professors were like this.
Loved the jokes
is this course completely free? I saw the "get free access" button but, you know, is the whole course free for public?
Yes, all that is required is an email address for full access on frontendmasters.com/trial/
By the halfway point he’s starting to turn
why frontend masters website looks like crap?
True, i would have expected them to at least have a great frontend 😂
Bro showers with hoodie on
Wait, Rustagean has legs?
My bro you don't need the hoodie here
How did no one yell "Hell yeah I'm excited" when he asked that question after completing the first sorting algo? Lame crowd!