Javascript Freecodecamp Algorithm #33: Implement Insertion Sort

Learn how to solve freecodecamp javascript algorithms in various ways! This series is up-to-date with all ES6 and beyond javascript notations
Start from the beginning of this series! - • Javascript Freecodecam...
Web Developer Roadmap 2020 Edition - • Video
#javascript #algorithms #freecodecamp

[@bishnuthapako]

I appreciate how you simplify it to enhance understanding. Thank you.

[@willifur]

I really like how you laid out the explanation here. It was very easy to follow and understand. The one liner you wrote for the index swapping was a nice new trick for the toolbelt. Thank you!

[@effiongbenjamin3305]

Bro thanks, I read over 5 articles and I didn't fully understand insertion sort until I found yours.

[@sonson4264]

Thanks, easy to understand solution.

[@sabsikhobhai]

Thanks for excellent explanation

[@poudlardo]

Thank you for your videos, you make it so simple to understand every time

[@okonkwo.ify18]

Finally I understand insertionsort(). Tutors now adays rather than explaining in the simplest way possible like this. They just write complicated codes and expect us to learn it. Geeksforgeeks is guilty in this regard

[@ruthylevi9804]

best solution & explanation! thank you :)

[@abhishekbharti704]

The title of this video should be "Insertion Sort Made Ez"...love the way he explained 🤓

[@fernandotoledo8093]

Hi Justin, (I really hope you see my comment).
I'm doing some research about a few algorithms, right now I'm working with Insertion Sort; I've seen a few other explanations from different people/websites and I found that you (and someone else on youtube) explain this implementation kind of different. You swap the items inside the inner loop, but other people only do a simple assignation inside the inner loop then they finish the swap just after the inner loop:
while (j > 0 && currentItem < arr[j - 1]) {
arr[j] = arr[j - 1];
j--;
}
arr[j] = currentItem;
I'm not saying that you are wrong in fact I like your implementation, but I just want to know if it's the same and why?

[@Mostafaabobakr7]

Same. And your is easier than this in video

[@trinzmelodiezz3987]

Thank you so much, you saved me from failing a class

[@henryleestudio]

Do you really need to { else } break??

[@mahyarekramian9040]

Awesome, easiest possible way

[@bori12370]

감사합니다

[@kevin73911]

Thank you

[@cmdv42]

💯✨🔥

[@muhammedillyas8788]

Nice explanation.

[@hasanimran340]

wow, I thing this is the easiest way. Thank you,

[@gianfrancoperaltabravo6004]

Thanks u a lot!

[@aaronargottelopez3488]

Thanks

[@Takatou__Yogiri]

this algorithm is not insertion sort.

[@soulful-intellect]

U are copying