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.
2012
2012
Average Case Analysis of Java 7's Dual Pivot Quicksort
Recently, a new Quicksort variant due to Yaroslavskiy was chosen as standard sorting method for Oracle's Java 7 runtime library… 
2011
2011
Study of High Efficiency Quick Sort Algorithm
Quick sort works fairly efficiently contrasting with other sort algorithms,but it has choke point when sorted data are in order… 
2010
2010
Ruffled Feathers: Shared narratives in the sage-grouse management conflict in Sublette County, Wyoming
2010
2010
Two Efficient Software Techniques to Detect and Correct Control-Flow Errors
This paper proposes two efficient software techniques, Control-flow and Data Errors Correction using Data-flow Graph… 
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… 
2005
2005
Performance and Analysis of Sorting Algorithms on the SRC 6 Reconfigurable Computer
Sorting is perhaps the most widely studied problem in computer science and is frequently used as a benchmark of a system’s… 
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… 
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)