Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of anâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2009

Highly Cited

2009

- Daniel Cederman, Philippas Tsigas
- ACM Journal of Experimental Algorithmics
- 2009

In this article, we describe GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multicore graphicsâ€¦Â (More)

Is this relevant?

2002

2002

- James Allen Fill, Svante Janson
- J. Algorithms
- 2002

The number of comparisons Xn used by Quicksort to sort an array of n distinct numbers has mean Î¼n of order n log n and standardâ€¦Â (More)

Is this relevant?

2001

2001

- James Allen Fill, Svante Janson
- Random Struct. Algorithms
- 2001

The limiting distribution of the normalized number of comparisons used by Quicksort to sort an array of n numbers is known to beâ€¦Â (More)

Is this relevant?

2000

2000

- Luc Devroye, James Allen Fill, Ralph Neininger
- ArXiv
- 2000

The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items isâ€¦Â (More)

Is this relevant?

1990

1990

- S. A. Levin
- Parallel Computing
- 1990

Sorting and related operations, such as finding percentiles, are traditional computer applications. For in-core sortingâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- P. Hennequin
- ITA
- 1989

We study probability distributions of several characteristic parameters on various forms of Quicksort algorithm: median-of-kâ€¦Â (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- Robert Sedgewick
- Commun. ACM
- 1978

This paper is a practical study of how to implement the Quicksort sorting algorithm and its best variants on real computersâ€¦Â (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- Robert Sedgewick
- Acta Informatica
- 1977

The Quicksort sorting algorithm and its best variants are presented and analyzed. Results are derived which make it possible toâ€¦Â (More)

Is this relevant?

1970

1970

- M. H. van Emden
- Commun. ACM
- 1970

A method is presented for the analysis of various generalzotions of quicksort. The average asymptotic number of comparisonsâ€¦Â (More)

Is this relevant?

Highly Cited

1961

Highly Cited

1961

- C. A. R. Hoare
- Commun. ACM
- 1961

s e n t infinity. I m a g i n a r y v a l u e s of x m a y not be n e g a t i v e a n d reM v a l u e s of x m a y n o t be s m aâ€¦Â (More)

Is this relevant?