The design and analysis of a new hybrid sorting algorithm

DOI10.1016/0020-0190(80)90143-XzbMath0447.68067OpenAlexW2030641205MaRDI QIDQ1146524

Selim G. Akl, Henk G. Meijer

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90143-x

zbMATH Keywords

expected complexityalgorithm design and analysissorting by comparisonsorting by distributionhybrid sorting algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Order statistics; empirical distribution functions (62G30)

Related Items (11)

Probabilistic integer sorting ⋮ Hybridsort revisited and parallelized ⋮ The multilevel principle applied to sorting ⋮ Usort: An efficient hybrid of distributive partitioning sorting ⋮ Sorting numbers in linear expected time and optimal extra space ⋮ Parallel distributive partitioned sorting methods ⋮ Quasi-Monotonic Sequences: Theory, Algorithms and Applications ⋮ Analysis of N-trees ⋮ The asymptotic behaviour of a distributive sorting method ⋮ Sorting in linear expected time ⋮ Some performance tests of convex hull algorithms

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

This page was built for publication: The design and analysis of a new hybrid sorting algorithm