B-tree: find: Difference between revisions
Jump to navigation
Jump to search
(Created page with "== General Information == == Abstract View == == Induction Basis == == Induction Step == == Complexity ==") |
|||
| Line 1: | Line 1: | ||
== General Information == | == General Information == | ||
'''Algorithmic problem:''' [[Sorted sequence|Sorted sequence: find]] | |||
'''Type of algorithm:''' loop | |||
'''Auxiliary data:''' A pointer '''''p''''' of type "pointer to a B-tree node". | |||
== Abstract View == | == Abstract View == | ||
Revision as of 21:52, 25 September 2014
General Information
Algorithmic problem: Sorted sequence: find
Type of algorithm: loop
Auxiliary data: A pointer p of type "pointer to a B-tree node".