B-tree: minimum: Difference between revisions
Jump to navigation
Jump to search
| Line 8: | Line 8: | ||
== Abstract View == | == Abstract View == | ||
'''Invariant:''' Before and after each iteration: | |||
# '''''p''''' points to some node '''''N''''' of the B-tree. | |||
'''Variant:''' '''''p''''' is redirected from the current node '''''N''''' to the first child of the current node. | |||
'''Break condition:''' | |||
# '''''p''''' points to a leaf of the B-tree. | |||
== Pseudocode == | == Pseudocode == | ||
Revision as of 11:44, 2 October 2014
General Information
Algorithmic Problem:
Type of algorithm: loop
Auxiliary data: A pointer p of type "pointer to a B-tree node".
Abstract View
Invariant: Before and after each iteration:
- p points to some node N of the B-tree.
Variant: p is redirected from the current node N to the first child of the current node.
Break condition:
- p points to a leaf of the B-tree.
Pseudocode
Minimum(x)
1 while leaf(x) = false
2 x = c_1(x)
3 return key_1(x)