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)

Related topics

Related topics

50 relations
ALGOLAlgorithmic efficiencyAnalysis of algorithmsBest, worst and average case

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A STATISTICAL COMPARATIVE STUDY OF SOME SORTING ALGORITHMS
This research paper is a statistical comparative study of a few average case asymptotically optimal sorting algorithms namely… 
2013
2013
Enhanced Insertion Sort Algorithm
Sorting is integral part of many computer based systems and applications, as it involves rearranging information into either… 
2010
2010
A Novel Image Median Filtering Algorithm based on Incomplete Quick Sort Algorithm
Quick sort algorithm is studied thoroughly, a new incomplete quick sort algorithm is designed, and then a novel image median… 
2008
2008
A new class of nature-inspired algorithms for self-adaptive peer-to-peer computing
We present, and evaluate benefits of, a design methodology for translating natural phenomena represented as mathematical models… 
2004
2004
Public perceptions of outstanding natural landscapes in the Auckland region
2001
2001
Visualising Objects: Abstraction, Encapsulation, Aliasing, and Ownership
Each object in an object-oriented program can correspond to one abstraction in the program's design. This correspondence makes… 
1997
1997
An analysis of superscalar sorting algorithms on an R8000 processor
We compare and analyze different in-memory sorting algorithms to understand their behavior on a superscalar MIPS R8000 processor… 
1985
1985
A hardware unification unit: design and analysis
The design of a hardware unit that performs unification operation is described and analyzed in this paper. In particular, the… 
1983
1983
Parallel sorting
Highly Cited
1980
Highly Cited
1980
The Forced-Free Distinction in Q Technique: A Note on Unused Categories in the Q Sort Continuum
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)