Fisher-Yates Shuffle Modern Algorithm JavaScript Programming Tutorial

[@jayesh1891]

even chatgpt couldn't beat this 9yo explanation 👏

[@AdamKhoury]

that's cool to hear!

[@eledorusso]

it is very true. I came here after chat gpt @@AdamKhoury

[@WyMustIGo]

ChatGPT is garbage, it isn't AI. I refer to ChatGPT as a smart filter because all it does is "filter" data that was scraped from the internet, it cannot make sense of anything that it did not get from the internet. There is a HUGE issue with this because most of the stuff on the internet is either factually incorrect, incomplete, biased, or injected to push an agenda. And, well, garbage in means garbage out. I have shown some blatant examples of how bad it is in various videos.

[@MikeEarleyfivestar]

OK I know it's been 11 years since you posted this video, but I deeply appreciate how well you explained this, starting with the physical manipulatives and moving to the code. This gave me a very good understanding of the functionality, thank you.

[@gabsfrmarqs]

I'm not studying JavaScript right now but i really liked your explanation about how the Fisher-Yates algorithm works, thanks :)

[@TraceguyRune]

The paper visualization was awesome. I was reading a documentation on this and was confused.

[@nugaskliping]

Something like this is what make me praise people of the past that invents like everything that can't be loaded by my slow brain

[@milanbudha3381]

Nobody was able to make understand this topic but you did it so simply..Thank you so much

[@sabitbayar9256]

I understood its logic in first 1.30 mins. thank u so much

[@Rhua_Raj]

great job it's been 10 years but still life saving tutotial

[@ShidehNaderi]

Your explanation is very very very clear. Thank you.

[@heavydirtysoul1491]

Author has done some great work. Thank you for creating this excellent tutorial. Even in 2021 it is actual same as it was in 2013

[@heavydirtysoul1491]

I have some second thoughts about this algorithm. Isn't the start of the array shuffled more actively than the end?

[@samuelobimakinde3305]

The video was instructive. Thanks, Khoury

[@AdamKhoury]

No sweat Samuel.

[@76ers]

The visual explanation is awesome! Please incorporate it whenever you can in future videos.

[@stacyjean-philippe2477]

Thank you so much for explaining this so well! I've been trying to wrap my head around this for the longest time.

[@AdamKhoury]

No problem Stacy. Thanks for the kind feedback.

[@hassan-rakib]

Oh my gosh! Finally I know how the Fisher-Yates method works. 🙂

[@sayedpritom]

Really Really Great Video. Your 2013 Video Tutorial Helped Me In 2020! & It Totally Felt Like A Tutorial of 2020. Many Thanks For Such Detailed & Consistent Explanation. The Concept Is Very Clear To Me Now. Alhamdulillah

[@kennethf6266]

This guy's a great teacher! Very useful stuff.

[@AllyNyan]

Very instructive video I didn't understand the wikipedia page but now I do

[@richardramos7267]

Thank you very much, the first time I've watch this I only watch the visual representation, and then I program it my own, I made it by looping the array from the end to 1, then inside that I made another loop, so it is nested loop, every time I loop it the end array will be replace inside the nested array with the random place of the array... But this method is more efficient and less code, It is really hard for me to understand, It takes me almost 2 days, dreaming about this problem, T_T but now I get it..

[@victorsuarez3]

Thank you so much for this. Amazing and simple explanation.

[@AdamKhoury]

Glad you enjoyed it!

[@Revelatus]

Great explanation of the algorithm, thank you

[@H0b0Gamers]

Awsome, more stuff like this please! Just the explanation alone was awsome. I saw the first part then wrote it in php before watching your code!

[@dougreiserrelief694]

Thank you for the code and good examples and an explanation that I understood.

[@seemsas]

I really like your tutorials, I've learned so much by them. Thanks!

[@ezekielthemack]

Excellent tutorial as always. Thanks.

[@PaulSebastianM]

Dis array is everywhere!

[@YannisStarwalker]

Thanks for another awesome tutorial, Adam!!

[@RagePeanut]

Thanks for this tutorial, been trying to do that today without any success. Thanks to you I've managed to do it, really well explained !

[@GeorgeHarrisonJr]

Thank you for this! By far one of the best explanations. Excellent !

[@hwangi0404]

As a beginner, my mind is fucking blown. Wow, holy crap!!!

[@asahifactory]

Thank you so so much! Finally I understand what is going on there!

[@dr.sleaseball441]

i try to learn JS. this was helpful, very well explained!

[@reromsp]

Thats a great explaination!! Thankyou

[@AdamKhoury]

Glad it was helpful!

[@kristenkumagai1791]

Really appreciate you posting this tutorial. Thank you!

[@usenli]

Thanks friend, very usufull visual explication

[@TkJarok]

Excelente! perfecto para aplicarlo en mi tarea de Polibios!

[@Thikondrius]

At 00:28 the letters swaped (probably a wrong cut), be carefull ^^. Thanks for the video it's super clear.

[@Sumdottycoy]

Awesome explanation. Implemented into my C game. :)

[@ARandomPerson--]

What game did you make?

[@vadimmalagurski5731]

Thanks for sharing your knowledge very clear explanation !

[@chrismaki5456]

I understand the explanation of what is happening when the code is executed (physically how it reshuffles within itself) but I'm still lost on the variables and their values and how they make it happen.

[@riiad]

I wish I could give this vid more than one thumbs-up

[@jaredroberge9957]

Solid video still. Been playing around with this particular shuffling method in c# for a unity project

[@dianaloredanasebo7215]

Great explanation. Thank you so much, sir! :)

[@expukpuk]

Thanks, mate. Nice piece of code.

[@m.sr.3088]

well done best example ever ....bwosss!!!

[@JM-jc1vz]

Good clear explanation, thank you.

[@glendonphilippbaculio1811]

your tutorials are great! thanks

[@souravsuman2633]

Thank you so much .....really good explanation

[@dankomilutinovic6792]

Thanks for this awesome tutorial!

[@HarshDoes]

Thank you so much for this 🙌

[@antoniocardenasfuentes1627]

Thank you so much! Great explanation.

[@christophervistal6036]

Thank you for this wonderful explanation :D

[@AdamKhoury]

No problem buddy.

[@sumangeorge7]

perfect.. thanks for the upload.

[@WinLoveCry]

Great stuff! Very informative.

[@hengamehoseini2666]

Great explanation! thank you!

[@Ginfio]

great explanation

[@limasntoinf]

Awesome. Thank you.

[@iLLestTv]

Help my black ass out alot. Needed this code for a game Im programming my g.

[@WanderSoulLife]

Hi thanks for this beautifully explained video. Can we use this algorithm for shuffling data sets for data analysis?

[@ARandomPerson--]

If you put all the data sets into an array I don't see why not

[@eledorusso]

incredible thank u

[@boricua12903]

OMG thank you for this video.

[@WanderSoulLife]

Thanks for this video. Can we use this method for shuffling a dataset?

[@maracamo]

Great, really good!!!!

[@frankwang1165]

very instructive even for a beginner, what I'm interested is how to make a subtitle for the video in different languages? it would very helpful for those non-english speakers to understand the conversation in a video with captions of both original and translated Frank Wang

[@jhogerguerrero2032]

Excellent!!!

[@43i3adam4]

Thanks a lot; very clear

[@AdamKhoury]

no sweat partner

[@AdamKhoury]

Fisher-Yates Shuffle Modern Algorithm JavaScript Programming Tutorial

[@grmmhp]

I'm not flawless, but you know, I got a diamond heart.

[@VDeshm]

Awesome tutorial....

[@vladankd]

This is great thanks

[@daisoreanulaurentiu3943]

such a shame that you have such a few views on such great tutorials

[@teebee5739]

Awesome video

[@LadyVibora69]

Thank you I understand all ^^ Thanks a lot really :D

as random() is used how can i mke this a encrypt / decrypt algo? or can you make a tut for this i want a custom style algo for enc and dec.

[@Phoebes8391]

good explanation

[@abbi1750]

Great explanation... tnx

[@dan339dan]

so visual, unlike some random speech explanation

[@Alacrity420]

awesome

[@thepvporg]

The prototype method is a good idea but for some people, they may get confused by it as I know from experience of tying to demonstrate to people in a web developer forum I frequent. I have used a different method of shuffling and one that uses a random number that is 0 to 'nth' where the random selects the array element, in my routine I remove the element and put it in to a results array, the routine runs for as many elements in the array, the result is very compact code and like most forums, people go on about performance, which would have been relevant 20 years ago but pose no issues with todays computers. ---------------------------------------------------------------------------- Array.prototype.shuffle = function(){ var s = []; while( this.length ) s.push( this.splice( -(~~(Math.random()*this.length)|0),1) ); return s; } testarray = ["some","data","is","here","so","we","can","shuffle","items","randomly"].shuffle(); ---------------------------------------------------------------------------- IMHO it is much faster to pull a set of elements out of an array by a random method than swapping, in the method I posted, your using a new array to store the results sequentially and the original array is reducing and the range of randoms gets lower as it would in the moving a pointer, the efficiency arguments and claims by some people are IMHO unfounded and when you examine the different methods, they are essentially doing the same thing. I have even weighted the random function to output a negative integer to pull from the end of the array like in the Fisher Yates demo you just gave. The output will produce something like [randomly, items, so, shuffle, we, some, can, here, is, data] and [we, so, randomly, can, here, data, some, shuffle, is, items] as an output. If your really paranoid that the sort is not random enough, you can run the shuffle twice or more times if you like...

[@TheRojo387]

This is good for implementing card games.

[@JNET_Reloaded]

Can you make a tut on how to make anagrams from words using a dictonary file and shuffle etc?

[@bmnbl]

Nice one.

[@dakota7369]

Does everything have the same odds of being chosen?

[@talentacquisition1746]

How can you add breaks to the results? Or can I call the results some how and style them?

[@fragrantbloom]

Shouldn"t i be arr.length-1 ? Thank you for the great explanation!

[@chiggywiggy524]

Maybe it has to do with the fact that he's use prefix --i instead of postfix i-- to decrement the value

[@titaniumwolf2]

thank you very much.

[@machan2524]

I wonder why A and G were swapped for the 3rd random number 5. Index position should be moved to E without moving G. That is, the last 3 alphabets of shuffled array are GBD.

[@gosinP]

Thank you.

[@davidjames1684]

If the random number is a 2 or a 1, we go to index position 1? I dont think so!

[@moideenferoke5955]

very nice

[@softwareengineering101]

Awesome

[@priyamvashi2187]

Thank you

[@guillemvila5960]

In case that the "Math.random" number is 1 in the first pass of the loop using the formula j = Math.floor (Math.random() * (i+1)); the result number would be 8. Wouldn't, then, return undefined? what about j = Math.floor (Math.random() * (max - min)) + min; ? The max value will always be 7. I'm learning to code and maybe I'm just talking nonsense.

[@kevnar]

Why decrement the range of the random number as you step down the loop? Why not just swap anywhere within the array? Wouldn't that give more randomness? It's not like it's saving time or memory to reduce the range.

[@samuelobimakinde3305]

I'm just learning programming, Kevnar. Your point is plausible. Can you please send me a code on how to do what you suggested?

[@kongminjeong1355]

thank you :)!!!!!

[@davidjames1684]

It took 2 guys to come up with this simple algorithm? Was it too much work for just 1 person?

[@adambach5721]

in the first loop of the "while" i=7 the maximum value may be 8 because we add 1 to the i and the random can also be 1, the j must be 0-7 and it looks like it can be 8 when we use (i+1), am I right or wrong?

[@adambach5721]

I found out, the Math.random () is from 0 (inclusive) to 1(EXCLUSIVE), to be able to use j=0-7 we must have floor of 0-7.9999

[@stefantataru8]

TNAKS YOUUUUUUUUUUUUUUUUU

[@Rhua_Raj]

i'm learing Fisher - Yates Algorithm for game dev in unity c#

[@fatmanur5409]

What if all the random index values are equal to the original index and all the variables stay in the same indices?

[@Oliveira529]

Depending on the number of elements, it is extremely unlikely

[@AdamKhoury]

One can record the original array into a temporary variable. Once the shuffle ends, one can compare the two arrays to see if they exactly match. If there is an exact match, run it through shuffle again. Oliveira529 is correct, extremely unlikely, but the above approach can double check it.

[@peristiloperis7789]

too good