Random Permutation
22,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
  • Broschiertes Buch

High Quality Content by WIKIPEDIA articles! A random permutation is a random ordering of a set of objects, that is, a permutation-valued random variable. The use of random permutations is often fundamental to fields that use randomized algorithms. Such fields include coding theory, cryptography, and simulation. A good example of a random permutation is the shuffling of a deck of cards. This is ideally a random permutation of the 52 cards. One method of generating a random permutation of a set of length n uniformly at random is to generate a sequence by taking a random number between 1 and n…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
High Quality Content by WIKIPEDIA articles! A random permutation is a random ordering of a set of objects, that is, a permutation-valued random variable. The use of random permutations is often fundamental to fields that use randomized algorithms. Such fields include coding theory, cryptography, and simulation. A good example of a random permutation is the shuffling of a deck of cards. This is ideally a random permutation of the 52 cards. One method of generating a random permutation of a set of length n uniformly at random is to generate a sequence by taking a random number between 1 and n sequentially. A simple algorithm to generate a permutation of n items uniformly at random without retries, known as the Knuth shuffle, is to start with the identity permutation or any other permutation, and then go through the positions 1 through n 1, and for each position i swap the element currently there with an arbitrarily chosen element from positions i through n, inclusive.