Dynamic Set
- Tags
- comp-sci
Is a set like data structure.
Table 1:
see page 3, [Operations] on sets.
| Method | Description |
|---|---|
Search(S,k) | Returns the element x with key k or null. |
Insert(S,k) | Adds an element x to S. |
Delete(S,k) | Removes the element x from S. |
Successor(S, x) | Return the next eleement to x in S. |
Predecessor(S, x) | Return the next eleement to x in S. |
Partially Ordered Set
Is a dynamic set where some elements are ordered before others.
Table 2:
see page 3, [Operations] on posets.
| Method | Description |
|---|---|
Minimum(S) | Return the smallest element in S. |
Maximum(S) | Return the largest element in S. |