Chapter 3. ADTs unsorted List and Sorted List. List Definitions. Linear relationship Each element except the first has a unique predecessor, and each element except the last has a unique successor. Length The number of items in a list; the length can vary over time. List Definitions.
ADTs unsorted List and Sorted List
Linear relationship Each element except the first has a unique predecessor, and each element except the last has a unique successor.
Length The number of items in a list; the length can vary over time.
Unsorted list A list in which data items are placed in no particular order; the only relationship between data elements is the list predecessor and successor relationships.
Sorted list A list that is sorted by the value in the key; there is a semantic relationship among the keys of the items in the list.
Key The attributes that are used to determine the logical order of the list.
Development of an Unsorted List ADT: UnsortedStringList
public boolean isFull ( )
// Returns whether this lis is full
return (list.length == numItems);
Ways we could reuse the code of the Unsorted List ADT to create the code for the Sorted List ADT:
Abstract Data Type Sorted List
Big-O Notation A notation that expresses computing time (complexity) as the term in a function that increases most rapidly relative to the size of a problem
f(N) = N4 + 100N2 + 10N + 50
then f(N) is 0(N4).
N represents the size of the problem.
Generic Data Type A type for which the operations are defined but the types of the items being manipulated are not
To Create a sorted list of strings use either of its constructors:
SortedList list1 = new SortedList();
SortedList list2 = new SortedList (size);
Declare at least one object of class ListString
Instantiate ListString objects and place them on the list.
aString = new ListString(“Amy”);