Fisher-Yates shuffle

preview_player
Показать описание
The Fisher–Yates shuffle is an algorithm for shuffling a finite sequence. The algorithm takes a list of all the elements of the sequence, and continually determines the next element in the shuffled sequence by randomly drawing an element from the list until no elements remain.
Рекомендации по теме
Комментарии
Автор

Thank you so much. Finally i understood how this works lols

aepeessla