第二章-线性表1)--英文.pptVIP

2.1 List A finite set of n（ ? 0） elements with the same characteristics (a0, a1, a2, a3, …….., an-1) 0= i n ai is element and n is the length Characteristics A finite set; Only one “the first” element; Only one “the last” element; Every Element except the first one has only one predecessor; Every Element except the last one has only one successor Preliminaries Empty – List contains no elements; Length – The number of elements stored; Head – The beginning of the list; Tail – The end of the list; Sorted list – The elements positioned in ascending order of value; Unsorted list – have no particular relationship between element values and positions. Operations on the ordered List Find the length of the list, n; Read the list from left to right ; Retrieve the i-th element,0= i =n-1; Store a new value into the i-th position, 0= i =n-1; Insert a new element at position i, 0= i =n-1 causing elements numbered i, i+….n to become numbered i+1, i+2, …., n+1; Delete the element at position i, 0= i =n-1 causing elements numbered i+1, …., n to become numbered i, i+1, …., n-1; 2.2 Array-Based List The most common way to represent an ordered list is by an array Representation of array-based list #define maxSize Typedef int T; Typedef struct { T data[maxSize]; int n; }SeqList; //静态表示 Typedef int T; Typedef struct { T *data; int maxSize, n; } SeqList; //动态表示 Implementation of some operations of list template class T LinearListT::LinearList ( int sz ) { //构造函数 if ( sz 0 ) { MaxSize = sz; last = -1; data = new T[MaxSize]; if (data==NULL) {cerr “Allocation Error” endl; exit(1);} } } template class T LinearListT::LinearList (LinearListTL) { //复制构造函数 maxSize = L.maxSize(); last =L.length()-1; data = new T[maxSize]; if (data==NULL) {cerr “Allocation Error” endl; exit(1);} for (i=1; i=last+1; i++) data[i-1] = L.getData(i); } template class T Line