B-tree: find

From Algowiki

Revision as of 21:52, 25 September 2014 by Jhohmann (talk | contribs) (→‎General Information)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

General Information

Algorithmic problem: Sorted sequence: find

Type of algorithm: loop

Auxiliary data: A pointer p of type "pointer to a B-tree node".

Abstract View

Induction Basis

Induction Step

Complexity

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=B-tree:_find&oldid=321"