ECE 198 Klefstad Containers: Ordered Lists and Sorted Lists Last Modified: 4/10/2002

Lists

We've dealt with unordered lists (e.g., LinkedList and ArrayList)
insert and remove were simplified because order did not matter

typical list operations are

void insert(Element o)
int find(Element o)
Element elementAt(int index)
int length()
void remove(Element o)
void expunge()
boolean isEmpty()
boolean isFull()
void print(ostream & out)

two other kinds of lists where order does matter
- OrderedList
- SortedList
again, typical implementation choices are Array and LinkedList

Ordered Lists

order is significant, but list is not sorted

void insert(Element o) // typically adds to the end
int find(Element o) // typically requires sequential (linear) search
void remove(Element o) // must maintain order
Element elementAt(int index)
int length()
void expunge()
boolean isEmpty()
boolean isFull()
void print(ostream & out)

Ordered Array Lists

an array list with shift-down and shift-up

void insert(Element o) // adds to the end
int find(Element o) // uses sequential (linear) search
void remove(Element o) // must maintain order, involves "crunch up"
Element elementAt(int index) // uses array indexing
int length()
void expunge()
boolean isEmpty()
boolean isFull()
void print(ostream & out)

Ordered Linked Lists

a linked list with a tail pointer

void insert(Element o) // typically adds to the end, use tail pointer
int find(Element o) // must use sequential (linear) search
void remove(Element o) // recursion or previous-node pointer
Element elementAt(int index) // must count nodes
int length() // must count nodes or keep integer count
void expunge()
boolean isEmpty()
boolean isFull()
void print(ostream & out)

Sorted Lists

an ordered list with items in sorted order

may be ascending (increasing) or descending (decreasing)

void insert(Element o)
int find(Element o)
Element elementAt(int index)
int length()
void remove(Element o)
void expunge()
boolean isEmpty()
boolean isFull()
void print(ostream & out)

Sorted Array Lists

use array list, but write shift-down and shift-up.

void insert(Element o) // must find position, shift-down, then insert
int find(Element o) // may use Binary Search in an array
Element elementAt(int index) // uses array indexing
int length() // stored in data member 'length'
void remove(Element o) // must find element, then shift-up
void expunge()
boolean isEmpty()
boolean isFull()
void print(ostream & out)

Sorted Linked Lists

simple linked list with head pointer

void insert(Element o) // find position, insert node, using 'prev' ptr
int find(Element o) // must use sequential search, but may stop early
Element elementAt(int index) // must count
int length() // must count
void remove(Element o) // must maintain order, previous-pointer
void expunge()
boolean isEmpty()
boolean isFull()
void print(ostream & out)