Asset Details
Do you wish to reserve the book?
Analysis of Algorithms for Permutations Biased by Their Number of Records
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Analysis of Algorithms for Permutations Biased by Their Number of Records
Do you wish to request the book?
Analysis of Algorithms for Permutations Biased by Their Number of Records
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Analysis of Algorithms for Permutations Biased by Their Number of Records
2016
Overview
The topic of the article is the parametric study of the complexity of algorithms on arrays of pairwise distinct integers. We introduce a model that takes into account the non-uniformness of data, which we call the Ewens-like distribution of parameter \\(\\) for records on permutations: the weight \\(^r\\) of a permutation depends on its number \\(r\\) of records. We show that this model is meaningful for the notion of presortedness, while still being mathematically tractable. Our results describe the expected value of several classical permutation statistics in this model, and give the expected running time of three algorithms: the Insertion Sort, and two variants of the Min-Max search.
Publisher
Cornell University Library, arXiv.org
Subject
