Skip to search formSkip to main contentSkip to account menu

Quicksort

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
In this article, we describe GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multicore graphics… 
Highly Cited
2008
Highly Cited
2008
Highly Cited
2007
Highly Cited
2007
In this paper we describe the design and implementation of CellSort - a high performance distributed sort algorithm for the Cell… 
Highly Cited
2004
Highly Cited
2004
Interaction and feedback are key factors supporting the learning process. Therefore many automatic assessment and feedback… 
Highly Cited
2003
Highly Cited
2003
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs.The… 
Highly Cited
1999
Highly Cited
1999
Highly Cited
1994
Highly Cited
1994
I. BASICS. 1. Quick-sort and Search. Quick-sort. Another view of quick-sort. Randomized binary trees. Skip lists. 2. What Is… 
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… 
Highly Cited
1961
Highly Cited
1961
  • C. Hoare
  • Communications of the ACM
  • 1961
  • Corpus ID: 207731384
Highly Cited
1961
Highly Cited
1961
b e g i n p r o c e d u r e RANGESUM (a, b, c, d, e, f); rea l a , b , c , d , e , f ; c o m m e n t The term "range number" was…