c++数据结构ppt(Chapter4).pptVIP

Container Types Sequence Containers Associative Containers Associative containers store elements by key. Ex: name, social security number, or part number. A program accesses an element in an associative container by its key, which may bear no relationship to the location of the element in the container. Adapter Classes An adapter contains another container as its underlying storage structure. The programmer interface for an adapter provides only a restricted set of operations from the underlying storage structure. The List Container Stack Containers Queue Containers Priority Queue Containers Set Containers Map Containers Template Class Template Class Vectors Output with Vectors Declaring Vector Objects Adding and Removing Vector Elements Resizing a Vector The Insertion Sort Insertion Sort Algorithm template typename T void insertionSort(vectorT v) { int i, j, n = v.size(); T target; // place v[i] into the sublist v[0] ... v[i-1], 1 = i n, // so it is in the correct position for (i = 1; i n; i++) { // index j scans down list from v[i] looking for // correct position to locate target. assigns it to v[j] j = i; target = v[i]; Insertion Sort Algorithm while (j 0 target v[j-1]) { // shift elements up list to make room for insertion v[j] = v[j-1]; j--; } // the location is found; insert target v[j] = target; } } Running Time 最坏情形 平均情形 最好情形 Joining Sorted Sublists #include iostream #include vector #include d_random.h #include d_sort.h #include d_util.h using namespace std; template typename T void join (vectorT vA, const vectorT vB); int main() { vectorint vSmall, vMedium, vLarge; randomNumber rnd; int i, value; for (i = 0; i 12; i++) { value = rnd.random(900) + 100; if (value 400) vSmall.push_back(value); else if (value 700 ) vMedium.push_back(value); else vLarge.push_back(value); } insertionSort(vSmall); cout