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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Media failures usually leave database systems unavailable for several hours until recovery is complete, especially in… 
2017
2017
This work has been supported by the DISCSIM project, grant agreement 341137 funded by the European Research Council under ERC… 
2015
2015
Shannon observed that the normal distribution has maximal entropy among distributions with a density function and a given… 
2012
2012
The recommendation system is a mechanism which automatically recommends items that are likely to be of interest to the user. In… 
2008
2008
The lattice An* is an important lattice because of its covering properties in low dimensions. Two algorithms exist in the… 
2007
2007
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
Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of… 
2006
2006
. We introduce here the problem of generalized partial sorting and chunksort , an algorithm closely related to quicksort and…