原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
arate y from z, and adjust x’s key count. Lines 18–20 write out all modified disk blocks.
The CPU time used by B-TREE-SPLIT-CHILD is Θ(t), due to the for loops in lines 5–6 and 8–9. (The for loops in lines 11–12 and 14–15 also run for O(t) iterations.) The procedure performs O(1) disk operations.
Figure 18.5 Splitting a node with t = 4. Node y = x.ci splits into two nodes, y and z, an
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea