Introspective Sorting and Selection Algorithms

@article{Musser1997IntrospectiveSA,
  title={Introspective Sorting and Selection Algorithms},
  author={David R. Musser},
  journal={Softw., Pract. Exper.},
  year={1997},
  volume={27},
  pages={983-993}
}
Quicksort is the preferred in-place sorting algorithm in many contexts, since its average computing time on uniformly distributed inputs is (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 (N 2). 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 heapsort, which has… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 128 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 13 references

The Standard Template Library

  • A. A. Stepanov, M. Lee
  • Technical Report HPL-94- 34, Hewlett-Packard…
  • 1994
2 Excerpts

Communications of the ACM

  • R. C. Singleton
  • 12:195{187
  • 1969
3 Excerpts

Similar Papers

Loading similar papers…