Asymptotic analysis of an optimized quicksort algorithm |
| |
Authors: | Marianne Durand |
| |
Affiliation: | Algorithms Project, INRIA Rocquencourt, 78153 Le Chesnay, France |
| |
Abstract: | Jon Bentley and Douglas McIlroy have implemented a fast quicksort for the C standard library in 1993. We consider here the average-case complexity in terms of number of comparisons of this algorithm, and give its asymptotic expansion up to the constant order. |
| |
Keywords: | Quicksort Euler equations Analysis of algorithms |
本文献已被 ScienceDirect 等数据库收录! |