Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,058,988 papers from all fields of science
Search
Sign In
Create Free Account
Quicksort
Known as:
Quick Sort
, Q sort
, External quicksort
Expand
Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ALGOL
Algorithmic efficiency
Analysis of algorithms
Best, worst and average case
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A STATISTICAL COMPARATIVE STUDY OF SOME SORTING ALGORITHMS
A. Kumari
,
N. Singh
,
Soubhik Chakraborty
2015
Corpus ID: 51773227
This research paper is a statistical comparative study of a few average case asymptotically optimal sorting algorithms namely…
Expand
2012
2012
Discovery of Causal Rules Using Partial Association
Zhou Jin
,
Jiuyong Li
,
Lin Liu
,
T. Le
,
Bing-Yu Sun
,
Rujing Wang
IEEE 12th International Conference on Data Mining
2012
Corpus ID: 15100873
Discovering causal relationships in large databases of observational data is challenging. The pioneering work in this area was…
Expand
2008
2008
A new class of nature-inspired algorithms for self-adaptive peer-to-peer computing
Steven Y. Ko
,
Indranil Gupta
,
Y. Jo
TAAS
2008
Corpus ID: 16078850
We present, and evaluate benefits of, a design methodology for translating natural phenomena represented as mathematical models…
Expand
2004
2004
Public perceptions of outstanding natural landscapes in the Auckland region
J. Fairweather
,
S. Swaffield
2004
Corpus ID: 129185567
2000
2000
A characterization of the set of fixed points of the Quicksort transformation
J. A. Fill
,
S. Janson
arXiv.org
2000
Corpus ID: 399
The limiting distribution $\mu$ of the normalized number of key comparisons required by the Quicksort sorting algorithm is known…
Expand
1997
1997
An analysis of superscalar sorting algorithms on an R8000 processor
J. Larriba-Pey
,
Daniel Jiménez-González
,
J. Navarro
Proceedings 17th International Conference of the…
1997
Corpus ID: 5444852
We compare and analyze different in-memory sorting algorithms to understand their behavior on a superscalar MIPS R8000 processor…
Expand
Highly Cited
1993
Highly Cited
1993
Object-Oriented Programming Using C++
I. Pohl
1993
Corpus ID: 56560139
This book is an excellent start for the professional programmer who wants to master C++ for use in an object-oriented environment…
Expand
1987
1987
Timing results of some internal sorting algorithms on vector computers
W. Rönsch
,
H. Strauss
Parallel Computing
1987
Corpus ID: 1482208
1983
1983
Parallel sorting
B. Bollobás
,
A. Thomason
Discrete Applied Mathematics
1983
Corpus ID: 205053663
Highly Cited
1980
Highly Cited
1980
The Forced-Free Distinction in Q Technique: A Note on Unused Categories in the Q Sort Continuum
Charles E. Cottle
,
Bruce Mckeown
Operant Subjectivity
1980
Corpus ID: 156834880
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE