A Perspective on Quicksort

Authors:
Joseph JaJa
Affiliations:
-
Venue:
Computing in Science and Engineering
Year:
2000

Citing 6
Cited 3

A comparison of sorting algorithms for the connection machine CM-2

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
A randomized parallel sorting algorithm with an experimental study

Journal of Parallel and Distributed Computing
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)
Implementing Quicksort programs

Communications of the ACM
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

An asymptotic theory for Cauchy---Euler differential equations with applications to the analysis of algorithms

Journal of Algorithms - Analysis of algorithms
Metric space similarity joins

ACM Transactions on Database Systems (TODS)
Performance assessment of multithreaded quicksort algorithm on simultaneous multithreaded architecture

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article introduces the basic Quicksort algorithm and gives a flavor of the richness of its complexity analysis. The author also provides a glimpse of some of its generalizations to parallel algorithms and computational geometry.