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.
2015
2015
This research paper is a statistical comparative study of a few average case asymptotically optimal sorting algorithms namely… 
2012
2012
Discovering causal relationships in large databases of observational data is challenging. The pioneering work in this area was… 
2008
2008
We present, and evaluate benefits of, a design methodology for translating natural phenomena represented as mathematical models… 
2000
2000
The limiting distribution $\mu$ of the normalized number of key comparisons required by the Quicksort sorting algorithm is known… 
1997
1997
We compare and analyze different in-memory sorting algorithms to understand their behavior on a superscalar MIPS R8000 processor… 
Highly Cited
1993
Highly Cited
1993
This book is an excellent start for the professional programmer who wants to master C++ for use in an object-oriented environment…