Live briefing
Everything about Partial sorting
Relaxed variant of the sorting problem
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 its elements all appear in order, while partial sorting is returning a list of the k smallest elements in order. The other elements may also be sorted, as in an in-place partial sort, or may be discarded, which is common in streaming partial sorts. A common practical example of partial sorting is computing the "Top 100" of some list. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Partial sortingA 5-minute orientation
- Skim a recent paper: Fast sorting method for lithium-ion batteries based on partial frequency bands of electrochemical impedance spectroscopyInfluential work since 2022
- Pick up a classic book: Markhams maister-peeceThe most-reprinted book on the subject
- Read the landmark paper: Wisconsin card sorting test performance in patients with complex partial seizures of temporal-lobe originCited 147 times
- Go sideways: IntrosortA closely related topic
- Go sideways: QuicksortA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Wisconsin card sorting test performance in patients with complex partial seizures of temporal-lobe origin
Spike sorting based on automatic template reconstruction with a partial solution to the overlapping problem
New sorting-based lossless motion estimation algorithms and a partial distortion elimination performance analysis
Preference disaggregation for multiple criteria sorting with partial monotonicity constraints: Application to exposure management of nanomaterials
Fast sorting method of retired batteries based on multi-feature extraction from partial charging segment
Algorithm 410: Partial sorting
New sorting-based partial distortion elimination algorithm for fast optimal motion estimation
Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
🆕 Influential since 2022
Fast sorting method for lithium-ion batteries based on partial frequency bands of electrochemical impedance spectroscopy
Improved Multi-GNSS PPP Partial Ambiguity Resolution Method Based on Two-Step Sorting Criterion
Fast and Simple Sorting Using Partial Information
Quantum Partial Sorting for Signal Decoding in Wireless Communication Systems
Partial loss of Sorting Nexin 27 resembles age- and Down syndrome-associated T cell dysfunctions
📚 Books worth reading
Markhams maister-peeceGervase Markham · 1615
Discrete Mathematics and Its ApplicationsKenneth H. Rosen · 1988
Mathematical structures for computer scienceJudith L. Gersting · 1982
Discrete and combinatorial mathematicsRalph P. Grimaldi · 1985
NUMERICAL RECIPES IN CWilliam H. Press, Brian P. Flannery · 1988
Discrete mathematicsNorman Biggs · 1985
Numerical recipes in Fortran 90William H. Press, Saul A. Teukolsky · 1996
Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Introsort Introsort or introspective sort is a hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance…
- Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…
- Sorting algorithm In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order…
- Selection algorithm In computer science, a selection algorithm is an algorithm for finding the kth smallest value in a collection of orderable values, such as numbers. The…
- Heapsort In computer science, heapsort is an efficient, comparison-based sorting algorithm that reorganizes an input array into a heap (a data structure where each…
- Median of medians In computer science, the median of medians is an approximate median selection algorithm, frequently used to supply a good pivot for an exact selection…
- Introselect In computer science, introselect (short for "introspective selection") is a selection algorithm that is a hybrid of quickselect and median of medians which…
- Sort (C++) sort is a generic function in the C++ Standard Library for doing comparison sorting. The function originated in the Standard Template Library (STL). The…