Linked Data Explorerhttp://worldcat.org/entity/work/id/372183171
A fast merging algorithm
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 All Close All
http://schema.org/about
- http://experiment.worldcat.org/entity/work/data/372183171#Topic/statistics_and_probability
- http://experiment.worldcat.org/entity/work/data/372183171#Topic/combinatorial_analysis
- http://id.worldcat.org/fast/837828
- http://id.loc.gov/authorities/subjects/sh85003487
- http://id.worldcat.org/fast/805020
- http://id.loc.gov/authorities/subjects/sh85014083
- http://experiment.worldcat.org/entity/work/data/372183171#Topic/algorithms
- http://experiment.worldcat.org/entity/work/data/372183171#Topic/order_statistics
- http://id.loc.gov/authorities/subjects/sh85016389
- http://experiment.worldcat.org/entity/work/data/372183171#Topic/binary_notation
- http://id.worldcat.org/fast/1156136
- http://id.worldcat.org/fast/831862
- http://id.loc.gov/authorities/subjects/sh85137259
http://schema.org/contributor
- http://experiment.worldcat.org/entity/work/data/372183171#Organization/stanford_univ_calif_dept_of_computer_science
- http://worldcat.org/entity/person/id/2634348854
- http://id.loc.gov/authorities/names/n84052634
- http://viaf.org/viaf/152491517
- http://worldcat.org/entity/person/id/2655810851
- http://worldcat.org/entity/person/id/2632777789
http://schema.org/description
- "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)."@en