Sorted sequence: Difference between revisions
Jump to navigation
Jump to search
(→Insert) |
|||
| Line 10: | Line 10: | ||
== Insert == | == Insert == | ||
'''Input:''' A key <math>K \in \kappa</math>. | |||
'''Output:''' | |||
'''Precondition:''' | |||
'''Postcondition:''' A new element with the key <math>K</math> is inserted at the appropriate position in sorting order. | |||
== Traverse == | == Traverse == | ||
Revision as of 11:02, 26 September 2014
General Information
Representation invariant:
- The abstract data structure sorted sequence implements sorted sequences as defined here.
- This abstract data structure is generic and parameterized by a fixed key type [math]\displaystyle{ \kappa }[/math] and a fixed comparision [math]\displaystyle{ c }[/math] defined on [math]\displaystyle{ \kappa }[/math].
Constructor: Gets a comparision [math]\displaystyle{ c }[/math] and initializes ths sequence so as to be empty.
Insert
Input: A key [math]\displaystyle{ K \in \kappa }[/math].
Output:
Precondition:
Postcondition: A new element with the key [math]\displaystyle{ K }[/math] is inserted at the appropriate position in sorting order.