|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
27 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Perfect simulation from the Quicksort limit distribution | | Luc Devroye
; James Allen Fill
; Ralph Neininger
; | | Date: |
23 May 2000 | | Subject: | Probability; Data Structures and Algorithms MSC-class: 65C10 (primary), 65C05, 68U20, 11K45 (secondary) | math.PR cs.DS | | Affiliation: | McGill Univ.), James Allen Fill (Johns Hopkins Univ.), Ralph Neininger (Univ. Freiburg | | Abstract: | The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional fixed-point equation. We give an algorithm for perfect random variate generation from this distribution. | | Source: | arXiv, math.PR/0005237 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER