Chapter 23 STL Algorithms （算法）.ppt

Chapter 23  STL Algorithms (算法） §23.1 Basics of STL Algorithms §23.2 The “copy” Algorithm §23.3 “sort” and “binary_search” §23.1 Basics of STL Algorithms Concepts Function, Operation, Algorithm * Operation Operation … Algorithm Function Implement Algorithm, Iterator, Container * Algorithms Containers Iterators Pointers themselves are iterators. The array pointers can be treated as iterators. Four Types of Algorithms About 80 algorithms in STL Four groups Nonmodifying Algorithms Modifying Algorithms Numeric Algorithms Heap Algorithms * §23.2 The copy Algorithm * template typename InputIterator, typename OutputIterator copy(InputIterator beg, InputIterator end, OutputIterator targetPostition) int values[] = {1,2,3,4,5,6}; vectorint intVector(5); listint intList(5); copy(values+2, values+4, intVector.begin()); copy(values, values+5, intList.begin()); #include algorithm #include vector #include list #include iterator Copy to Output Stream * intVector.insert(intVector.begin(), 747); ostream_iteratorint output(cout, ); cout\nAfter the insertion funciton, intVector: ; copy(intVector.begin(), intVector.end(), output); The copy Demo * After initial copy intVector: 3 4 0 0 0 After initial copy intList: 1 2 3 4 5 After the insertion function, intVector: 747 3 4 0 0 0 After the copy function, intList: 747 3 4 0 5 int values[] = {1,2,3,4,5,6}; vectorint intVector(5); listint intList(5); copy(values+2, values+4, intVector.begin()); copy(values, values+5, intList.begin()); intVector.insert(intVector.begin(), 747); copy(intVector.begin(), intVector.begin()+4, intList.begin()); int values[] = {1,2,3,4,5} vectorint intVector; copy(values+2, values+4, intVector.begin()); Caution The target container in copying must contains enough elements to store the values from the source container * §23.3 “sort” and “binary_search” * template typename RandomAccessIterator void sort(RandomAccessIterator beg, RandomAccessIterator end) template typename RandomAc