Generating a random cyclic permutation
Copyright policy )Generating a random cyclic permutation
We prove correct an algorithm that, given \(n>0\), stores in array b[0..n- 1] a random cyclic permutation of the integers in 0..n-1, with each cyclic permutation having equal probability of being stored in b. The algorithm was developed by Sattolo; our contribution is to present a more convincing proof using standard program-proving methods.
- Cornell University United States
Permutations, words, matrices, Discrete mathematics in relation to computer science, Specification and verification (program logics, model checking, etc.), algorithm, program correctness proof, random cyclic permutation, Algorithms in computer science
Permutations, words, matrices, Discrete mathematics in relation to computer science, Specification and verification (program logics, model checking, etc.), algorithm, program correctness proof, random cyclic permutation, Algorithms in computer science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).7 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!