David Musser  Home/Search
Context Related
| rpi.edu/~musser/gp/introsort.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rpi.edu/~musser/gp/index_1 (more) Homepages: D.Musser |
Rate this article:      (best)Comment on this article |
Abstract: Quicksort is the preferred in-place sorting algorithm in many contexts, since its average computing time on uniformly distributed inputs is \Theta(N log N) and it is in fact faster than most other sorting algorithms on most inputs. Its drawback is that its worst-case time bound is \Theta(N ). Previous attempts to protect against the worst case by improving the way quicksort chooses pivot elements for partitioning have increased the average computing time too much---one might as well use... (Update)
Cited by: More
Super Scalar Sample Sort - Sanders, Winkel (2004) (Correct)
An asymptotic theory for Cauchy-Euler differential.. - Chern, Hwang, Tsai (2002) (Correct)
Active bibliography (related documents): More All
0.2: Studies of Spin Relaxation and Recombination at the HERMES.. - Baumgarten (2000) (Correct)
0.2: Geometric Aspects in the Theory of Krylov Subspace Methods - Eiermann, Ernst (1998) (Correct)
0.2: New silicon-detector systems for the HERMES front region - The Hermes Collaboration (1997) (Correct)
Similar documents based on text: More All
0.5: A Limit Theorem for "Quicksort" - Rösler (1999) (Correct)
0.4: On the Performance of WEAK-HEAPSORT - Edelkamp, Wegener (2000) (Correct)
0.3: Implementing HEAPSORT with n log n - 0.9n and QUICKSORT.. - Edelkamp, Stiegeler (Correct)
Related documents from co-citation: More All
2: Optimal sampling strategies in quicksort and quickselect (context) - Martnez, Roura - 2001
BibTeX entry: (Update)
D.R. Musser, Introspective sorting and selection algorithms, Software--Pract. Exp. 27 (1997) 983--993. http://citeseer.ist.psu.edu/musser97introspective.html More
@article{ musser97introspective,
author = "David R. Musser",
title = "Introspective Sorting and Selection Algorithms",
journal = "Software - Practice and Experience",
volume = "27",
number = "8",
pages = "983--993",
year = "1997",
url = "citeseer.ist.psu.edu/musser97introspective.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
174 Time bounds for selection (context) - Blum, Floyd et al. - 1973
108 Communications of the ACM (context) - Hoare, partition et al. - 1961
97 Computer Journal (context) - Hoare - 1962
48 Algorithm-oriented generic libraries - Musser, Stepanov - 1994
40 The influence of caches on the performance of sorting - LaMarca, Ladner - 1997
34 Hewlett-Packard Laboratories (context) - Stepanov, Lee et al. - 1994
23 Average case complexity under the universal distribution equ.. - Li, Vit'anyi - 1992
23 Communications of the ACM (context) - Williams, heapsort - 1964
22 Implementing quicksort programs (context) - Sedgewick - 1978
21 STL Tutorial and Reference Guide: C++ Programming with the S.. (context) - Musser, Saini - 1996
21 Software Practice and Experience (context) - Bentley, McIlroy et al. - 1993
5 Private communication (context) - Stewart
1 Communications of the ACM (context) - Singleton - 1969
ftp://ftp.cs.rpi.edu/pub/stl
Documents on the same site (http://www.cs.rpi.edu/~musser/gp/index_1.html):
A Fast Generic Sequence Matching Algorithm - Musser, Nishanov (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC