Data Structures - University of Florida数据结构-佛罗里达大学.pptVIP

Data Structures data object set or collection of instances integer = {0, +1, -1, +2, -2, +3, -3, …} daysOfWeek = {S,M,T,W,Th,F,Sa} Data Object instances may or may not be related myDataObject = {apple, chair, 2, 5.2, red, green, Jack} Data Structure Data object + relationships that exist among instances and elements that comprise an instance Among instances of integer 369 370 280 + 4 = 284 Data Structure 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 The relationships are usually specified by specifying operations on one or more instances. add, subtract, predecessor, multiply Linear (or Ordered) Lists instances are of the form (e0, e1, e2, …, en-1) where ei denotes a list element n = 0 is finite list size is n Linear Lists L = (e0, e1, e2, e3, …, en-1) relationships e0 is the zero’th (or front) element en-1 is the last element ei immediately precedes ei+1 Linear List Examples/Instances Students in COP3530 = (Jack, Jill, Abe, Henry, Mary, …, Judy) Exams in COP3530 = (exam1, exam2, exam3) Days of Week = (S, M, T, W, Th, F, Sa) Months = (Jan, Feb, Mar, Apr, …, Nov, Dec) Linear List Operations—size() determine list size L = (a,b,c,d,e) size = 5 Linear List Operations—get(theIndex) get element with given index L = (a,b,c,d,e) get(0) = a get(2) = c get(4) = e get(-1) = error get(9) = error Linear List Operations—indexOf(theElement) determine the index of an element L = (a,b,d,b,a) indexOf(d) = 2 indexOf(a) = 0 indexOf(z) = -1 Linear List Operations—remove(theIndex) remove and return element with given index L = (a,b,c,d,e,f,g) remove(2) returns c and L becomes (a,b,d,e,f,g) index of d,e,f, and g decrease by 1 Linear List Operations—remove(theIndex) remove and return element with given index L = (a,b,c,d,e,f,g) Linear List Operations—add(theIndex, theElement) add an element so that the new element has a specified index L = (a,b,c,d,e,f,g) add(0,h) =