The Last Algorithms Course You'll Need by ThePrimeagen | Preview 

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

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.

😂

Good one 🤣🤣

i dont trust any coder who doesnt wear one ;d

"I teach on Windows!! I teach on Windows... Shut up!!"

Me too 🙂

It's still him, just a diluted version, I still love it.

Definitely inspired me to learn vim 2 years ago :D

vanilla i3 is unusable, gotta change those motions to vim keys

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

JDSL FTW!!!11! (NOT!) 🙂

This course is free bro

Yes it is!

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

Cold hard cache rules the world.

I think you could use a Symbol to store your own object ID. Good idea! One minor problem is that this consumes memory. ☹

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 😂

Yes, it's a preview of his algorithm course on frontendmasters

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"

Everything is available on our website. This course is 100% free forever, only email is required: frontendmasters.com/courses/algorithms/

You can, but he explains how the sort function is written.

JavaScript/TypeScript

System 76

True story, I tried to post this joke a minute ago and it was so bad my laptop crashed.

It's hash map. Which generates key with a predefined function

The full course is on our website for free here frontendmasters.com/trial/

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!

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)