The design and analysis of a new hybrid sorting algorithm
From MaRDI portal
Publication:1146524
DOI10.1016/0020-0190(80)90143-XzbMath0447.68067MaRDI QIDQ1146524
Publication date: 1980
Published in: Information Processing Letters (Search for Journal in Brave)
expected complexity; algorithm design and analysis; sorting by comparison; sorting by distribution; hybrid sorting algorithm
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
62G30: Order statistics; empirical distribution functions
Related Items
The multilevel principle applied to sorting, Sorting in linear expected time, Some performance tests of convex hull algorithms, Hybridsort revisited and parallelized, Usort: An efficient hybrid of distributive partitioning sorting, Sorting numbers in linear expected time and optimal extra space, Analysis of N-trees, The asymptotic behaviour of a distributive sorting method, Probabilistic integer sorting, Quasi-Monotonic Sequences: Theory, Algorithms and Applications, Parallel distributive partitioned sorting methods
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Sorting by distributive partitioning
- An efficient algorithm for determining the convex hull of a finite planar set
- Location of a Point in a Planar Subdivision and Its Applications
- New Parallel-Sorting Schemes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
