Skip to search formSkip to main contentSkip to account menu

Partial sorting

Known as: Partial quicksort, Partial sort, Quickselsort 
In computer science, partial sorting is a relaxed variant of the sorting problem. Total sorting is the problem of returning a list of items such that… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Average-case complexityC++Communications of the ACMComputer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Instant restore after a media failure (extended version)
2017
2017
Instant Restore After a Media Failure
Media failures usually leave database systems unavailable for several hours until recovery is complete, especially in… 
2017
2017
Chemical enrichment of the planet-forming region as probed by accretion
This work has been supported by the DISCSIM project, grant agreement 341137 funded by the European Research Council under ERC… 
2015
2015
Classifying distributions via symbolic entropy estimation
Shannon observed that the normal distribution has maximal entropy among distributions with a density function and a given… 
2012
2012
Multi‐GPU algorithm for k‐nearest neighbor problem
The recommendation system is a mechanism which automatically recommends items that are likely to be of interest to the user. In… 
2008
2008
A linear-time nearest point algorithm for the lattice An*
The lattice An* is an important lattice because of its covering properties in low dimensions. Two algorithms exist in the… 
2007
2007
Pictures from Mongolia - Partial Sorting in a Partial World
You are back from that very long, marvelous journey. You have a thousand pictures, but your friends and relatives will stand just… 
Review
2007
Review
2007
Under review for IEEE Transactions on Parallel and Distributed Systems Parallel Construction of Multidimensional Binary Search Trees
Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of… 
2006
2006
Chunksort: a generalized partial sorting algorithm
. We introduce here the problem of generalized partial sorting and chunksort , an algorithm closely related to quicksort and… 
1982
1982
Construction of the two-electron interaction matrix fron a P supermatrix file: An improved algorithm
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)