3 is more promising algorithmic parameter than 2

DOI10.1016/S0898-1221(98)00158-8zbMath0949.68521OpenAlexW2011187288WikidataQ127780884 ScholiaQ127780884MaRDI QIDQ1125001

S. H. Smith

Publication date: 29 November 1999

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(98)00158-8

zbMATH Keywords

ternary systems

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (2)

An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons ⋮ Probabilistic analysis of algorithms for the Dutch national flag problem

Cites Work

• An optimal algorithm for deleting the root of a heap
• Worst-case analysis of a generalized heapsort algorithm
• Average-case results on heapsort
• Embedding ternary trees in VLSI arrays
• Is binary encoding appropriate for the problem-language relationship?
• The Analysis of Heapsort
• On an optimality property of ternary trees

This page was built for publication: 3 is more promising algorithmic parameter than 2