is the Fisher–Yates Shuffle. The modern method of this algorithm is to choose an entry from the table at random and swap it with the entry at the end of the table.
My question is first what is “swap it with the entry at the end of table”? AND…
If If I wanted to create a database of the shuffle…say…instead of 52 cards,because 52 cards in a deck, say…
1000 cards. AND…Could you also call the cards something else, like 1000, “words”.so you have a thousand words. AND…
…You already
have a word…
AS A RESULT…the word from the shuffle would make another word combined with your word, AND…show the two words to you.
Is that possible to be applied to this algorithm?
and is the Shuffling Table Data (Deck of playing cards), template, similar to it? [import]uid: 88495 topic_id: 34867 reply_id: 334867[/import]