1. Creation
SortedArray<Item> | a; |
sizeof(Item)
* DEFAULT_SIZE (see general.h)
is used. O(1)
SortedArray<Item> | a( (int) sz); |
Item
s. O(1)
SortedArray<Item> | a( (SortedArray<Item>&) a); |
SortedArray<Item> | a( (Container<Item>&) c); |
2. Operations
SortedArray<Item>& | operator= (SortedArray<Item>& a) |
ContainerNode * | insert (Item item) |
ContainerNode * | append (Item item) |
Bool | sortedQ () const |
int | search (Item) |
Item | min () |
Item | max () |