Knuth Shuffle made simple in 5 mins
HTML-код
- Опубликовано: 29 сен 2024
- Knuth Shuffle, aka Fisher-Yates shuffle or simply list shuffle is a way to randomly order things in an array or list. In this video we explain how it works and implement it.
Please support me through my Udemy courses:
Pass your coding interview in,
Java : www.udemy.com/...
Python: www.udemy.com/...
Ruby: www.udemy.com/...
JavaScript: www.udemy.com/...
Multithreading in,
Go Lang: www.udemy.com/...
Python: www.udemy.com/...
Java: www.udemy.com/...
Learn Dynamic Programming in,
Java: www.udemy.com/...
Python: www.udemy.com/...
Ruby: www.udemy.com/...
You know the awesome way to teach complex topics. More videos please. 👍🏼
Is this Khan Academy in disguise??
On a serious note
I was kinda lost when I read just the algorithm online but this video just made everything so much clearer. Great job!
You taught me Knuth Shuffle within five minutes! I have been scratching my head since yesterday looking at the explanations on the web.
Thank you! Great presentation and delivery. Very easy to understand. Subscribed!
Nicely explained. The complicated part is it’s name. 👍
Could there be figures that do not change locations? For example, "A,B,C,D,E" could A ever be the first post-randomiztion?
Yes. But the same is true with a "real life" shuffle. If you shuffle a deck of cards, any cards could be in the same position after the shuffle. Indeed, to be a true random shuffle, this needs to be the case. If items were guaranteed *not* to be in the same position, that provides information about the previous state, which means it can't be truly random.
well explained as always :) thank you
Great video!
great work
this is a great explanation! Thank you very much,.
There are multiple errors in this presentation. Downvoted.
Finally a clear explanation. Thank you James!
Great explanation in 5 minutes.