Items related to Random permutation statistics: Permutation Group, Random...
Random permutation statistics: Permutation Group, Random Permutation, Selection Algorithm, Quicksort, Fundamental Theorem of Combinatorial Enumeration, Generating Function, Formal Power Series - Softcover
Reseña del editor
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The statistics of random permutations, such as the cycle structure of a random permutation are of fundamental importance in the analysis of algorithms, especially of sorting algorithms, which operate on random permutations. Suppose, for example, that we are using quickselect (a cousin of quicksort) to select a random element of a random permutation. Quickselect will perform a partial sort on the array, as it partitions the array according to the pivot. Hence a permutation will be less disordered after quickselect has been performed. The amount of disorder that remains may be analysed with generating functions. These generating functions depend in a fundamental way on the generating functions of random permutation statistics. Hence it is of vital importance to compute these generating functions. The article on random permutations contains an introduction to random permutations.
"About this title" may belong to another edition of this title.
- PublisherBetascript Publishing
- Publication date2010
- ISBN 10 6130344120
- ISBN 13 9786130344122
- BindingTapa blanda
- LanguageEnglish
- Number of pages144
- EditorSurhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want
