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.
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Information Systems
- Hardware and Architecture
- Artificial Intelligence