1962
DOI: 10.1093/comjnl/5.1.10
|View full text |Cite
|
Sign up to set email alerts
|

Quicksort

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
449
0
17

Year Published

1997
1997
2009
2009

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 824 publications
(468 citation statements)
references
References 0 publications
2
449
0
17
Order By: Relevance
“…Hoare suggested in his paper [16] that it would be more efficient to use another sorting method when the subsequences are relatively small, since the overhead of the partitioning gets too large when dealing with small sequences. We decided to follow that suggestion and sort all subsequences that can fit in the available local shared memory using an alternative sorting method.…”
Section: Overviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Hoare suggested in his paper [16] that it would be more efficient to use another sorting method when the subsequences are relatively small, since the overhead of the partitioning gets too large when dealing with small sequences. We decided to follow that suggestion and sort all subsequences that can fit in the available local shared memory using an alternative sorting method.…”
Section: Overviewmentioning
confidence: 99%
“…By doing that, Hoare have showed [16] that the maximum recursive depth can never go below log 2 (n). We use an explicit stack as suggested by Hoare and implemented by Sedgewick, always storing the smallest subsequence at the top [17].…”
Section: Detailed Descriptionmentioning
confidence: 99%
“…To demonstrate the capabilities of the CTB system, an implementation of the quick-sort partition algorithm [25], shown in Figure 3, was analysed. This method partitions a subsection of an array of integers a into two groups: only elements between indices low and high (inclusive) are processed.…”
Section: Analysis Of a Sample Methodsmentioning
confidence: 99%
“…Proofs of the O(n log n) average-case complexity of Quicksort [1] are included in many textbooks on computational complexity [9, for example]. This paper documents what the authors believe to be the first fully formal machine-checked version of such a proof, developed using the Coq proof assistant [2].…”
Section: Introductionmentioning
confidence: 91%