原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
(x, i) 6 elseif x.leaf 7 returnNIL 8 else DISK-READ(x.ci) 9 return B-TREE-SEARCH(x.ci, k)
Using a linear-search procedure, lines 1–3 of B-TREE-SEARCH find the smallest index i such that k ≤ x.keyi, or else they set i to x.n + 1.
Lines 4–5 check to see whether the search has discovered the key, returning if it has. Ot
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea