Linear Lists – Array Representation.PPT

* Linear Lists – Array Representation CSE, POSTECH * Introduction Data Object a set of instances or values Examples: Boolean = {false, true} Digit = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} Letter = {A, B, C, …, Z, a, b, c, …, z} String = {a, b, …, aa, ab, ac,…} An individual instance is either primitive or composite. An element is the individual component of a composite instance. * Introduction Data Structure data object together with the relationships among instances and elements that comprise an instance Among instances of integer 369 370 280+4 = 284 Among elements that comprise an instance 369 3 is more significant than 6 3 is immediately to the left of 6 9 is immediately to the right of 6 * Introduction Abstract Data Type (ADT) ADT is a collection of data and a set of operations that can be performed on the data. It enables us to think abstractly about the data … We can separate concepts from implementation. Typically, we choose a data structure and algorithms that provide an implementation of an ADT. * Linear List Definitions Linear list is a data object whose instances are of the form (e1,e2,…,en) ei is an element of the list. e1 is the first element, and en is the last element. n is the length of the list. When n = 0, it is called an empty list. e1 comes before e2, e2 comes before e3, and so on. Examples student names order by their alphabets a list of exam scores sorted by descending order * ADT for Linear List AbstractDataType LinearList { instances ordered finite collections of zero or more elements operations Create(): create an empty linear list Destroy(): erase the list IsEmpty(): return true if empty, false otherwise Length(): return the list size Find(k,x): return the kth element of the list in x Search(x): return the position of x in the list Delete(k,x): delete the kth element and return it in x Insert(k,x): insert x just after the kth element Output(out): put the list into the output stream out } * Implementations of Linear Li