A Fast Merging Algorithm

Mark R. Brown, Robert Endre Tarjan

Research output: Contribution to journalArticle

58 Scopus citations

Abstract

An algonthm that merges sorted hsts represented as height-balanced binary trees 1s given If the hsts have lengths m and n [formula omitted] then the merging procedure runs m O(m log(n/m)) steps, which is the same order as the lower bound on all companson-based algorithms for this problem.

Original languageEnglish (US)
Pages (from-to)211-226
Number of pages16
JournalJournal of the ACM (JACM)
Volume26
Issue number2
DOIs
StatePublished - Apr 1 1979
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Information Systems
  • Hardware and Architecture
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'A Fast Merging Algorithm'. Together they form a unique fingerprint.

  • Cite this