A Fast Merging Algorithm.

Abstract

An algorithm which merges sorted lists is represented as balanced binary tree. If the lists have lengths m and n (m < or = n) then the merging procedure runs in 0 (m log n/m) steps, which is the same order as the lower bound on all comparison-based algorithms for this problem. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1977
Accession Number
ADA046090

Entities

People

  • Mark R. Brown
  • Robert Tarjan

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Anti-Radiation Missiles
  • Arm
  • Assembly Languages
  • Computer Programming
  • Computer Science
  • Computers
  • High Level Languages
  • Language
  • Lists (Data Structures)
  • Military Research
  • Programming Languages
  • Terminals
  • Trees (Data Structures)
  • Unified Combatant Commands
  • Universities

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.