Searching and sorting real numbers

DOI10.1016/0196-6774(81)90002-XzbMATH Open0477.68060OpenAlexW2059575356MaRDI QIDQ3933754FDOQ3933754

Authors: Gideon Ehrlich 

Publication date: 1981

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(81)90002-x

zbMATH Keywords

analysis of algorithmssorting algorithmssearching algorithmnumeric key values as source of information

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cited In (6)

• Some results on tries with adaptive branching.
• Analysis of random LC tries
• Sorting numbers in linear expected time and optimal extra space
• Distribution of the size of random hash trees, pebbled hash trees and \(N\)-trees
• On search by address computation
• Analysis of N-trees

This page was built for publication: Searching and sorting real numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3933754)