Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 5
Highly Cited
2004
Highly Cited
2004
Interaction and feedback are key factors supporting the learning process. Therefore many automatic assessment and feedback… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
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… Expand
Highly Cited
1991
Highly Cited
1991
  • U. Rösler
  • RAIRO Theor. Informatics Appl.
  • 1991
  • Corpus ID: 28885848
Soit X n le nombre de comparaisons utilisees par la procedure Quicksort pour trier une liste de nombres distincts. Nous… Expand
Highly Cited
1991
Highly Cited
1991
Abstract Many probabilistic properties of elementary discrete combinatorial structures of interest for the average-case analysis… Expand
  • figure 1
  • figure 2
  • figure 3
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… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Highly Cited
1961
Highly Cited
1961
  • C. Hoare
  • Commun. 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… Expand