共 12 条
[11]
TRABBPARDO L, 1978, THESIS STANFORD U
[12]
[No title captured]
FAST MERGING ALGORITHM
被引：55
作者：
BROWN, MR
[1
]
TARJAN, RE
[1
]
机构：
[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
关键词：
2-3;
tree;
AVL tree;
height-balanced tree;
linear list;
merging;
D O I：
10.1145/322123.322127
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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. © 1979, ACM. All rights reserved.
引用
收藏
页码：211 / 226
页数：16
相关论文