Quicksort

Known as: Q sort, External quicksort, Randomized quicksort 
Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1961-2018
0204019612018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
In this article, we describe GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multicore graphics… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2002
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
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
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
Sorting and related operations, such as finding percentiles, are traditional computer applications. For in-core sorting… (More)
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
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
This paper is a practical study of how to implement the Quicksort sorting algorithm and its best variants on real computers… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1977
Highly Cited
1977
The Quicksort sorting algorithm and its best variants are presented and analyzed. Results are derived which make it possible to… (More)
  • figure 1
  • figure 2
  • figure 2
  • table 1
Is this relevant?
1970
1970
A method is presented for the analysis of various generalzotions of quicksort. The average asymptotic number of comparisons… (More)
  • table I
Is this relevant?
Highly Cited
1961
Highly Cited
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?