A simple deterministic algorithm sorts n items with m given comparisons in O(m + log T) time using O(log T) comparisons by combining topological sort, heapsort, and binary search.
[VR24] Ivor van der Hoog and Daniel Rutschmann
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fast and Simple Sorting Using Partial Information
A simple deterministic algorithm sorts n items with m given comparisons in O(m + log T) time using O(log T) comparisons by combining topological sort, heapsort, and binary search.