How to shuffle an array (Fisher-Yates algorithm) - Inside code

NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks!
NB2: Discounts of courses above are permanent

[insidecode]

🔴
/ \
🔵—🔴
| |
🔴—🔵

[MartinOmander]

Very clear and visual explanation of Fisher-Yates, including why it's better. I've used the algorithm in my code without really understanding it. Now I do, which feels good. You are great at explaining things!

[pupper]

This was fantastic! Very clear way to teach each of the three shuffling algorithms. I wanted to create a shuffling algorithm in Perl in order to learn the language more deeply, and I was able to create the algorithm (Fisher-Yates Modernized) in a very pleasant fashion thanks to your video! Thank you so much and I wish you have a lovely day!

[udaywahi]

I implemented this algorithm myself for shuffling deck of cards without even knowing that it's already a well known algorithm. Saw your video and noticed it

[antoine]

2:50 bucket sort can be used in this case and it yields a sorting in O(n)

[ujjvalsharma]

Wonderful explanation/solution. You deserve more subscribers!! And success will follow you

[einmax]

woow, good one, compact, simplified, understandable, just as content in this genre should be, keep up the good work man

[RYS-zrho]

So clear for the Fisher-Yate shuffle algorithm, thank you so much!

[IsomerMashups]

Elegant algorithm, elegant explanation. Thank you.

[baitongli]

The linear time solution isn't truly same as the first two because the last element in the array is always moved away. However, it should have a small chance to stay in its original position in the final result. I think we should add an additional swap to fix this.

[AdithyaChakilam]

It would have been great if you said a point about why generating random number would be O(1) because all 3 solutions need it. Nice video!

[akshayyadav]

Great! This channel will get more engaged soon!👍

[angpanha]

can the fisher-yates shuffle start from the first index as long as we keep track of the unshuffled and shuffled part correctly?

[ihgnmah]

what can I say? Brilliant!!! Brilliant!!!

[TacticalPrime_]

Im a little bit confused because shuffle the deck should be completly random, and correct me if im wrong but in the modern version its not really random cause the last index could never be shuffled into the position which kinda make it 100% for the last card to be diifferent which means is not completly random...
am i missing something or is it just the way it designed?

[MinecraftWitaminaPL]

Interesting. I did this in similar way to third method. I itereted through an array (0, n) then I took random element from range (0, n) and swapped that with the choosen one. Swap(i, rand(0, n) ; I think this is actually a little better beacuse it is shuffling the last element. In your case 7.

[dfgsdgfdoker]

Can you make a video about the differences between time and space complexity?
Anyway, thanks for the content, you explain it great.

[bp]

Damn, Fisher and Yates deserve no credit whatsoever lol. I'm calling it the Durstenfeld shuffle from now on.

[rakeshreddypallepati]

short and sweet ...384 leetcode if someone wants to practice in leetcode