C++ > Visual C++ 5.0 Standard C++ Library Code Examples C++ Code > Adjacent find algorithm finds consecutive pairs of matching elements in a sequence. C++ Code > Binary Search - Returns a boolean value indicating whether or not val was found. C++ Code > Algorithm copy - Copies elements from one range to another. C++ Code > Algorithm copy backward - Copy a range of elements backwards to another range. C++ Code > The count algorithm counts the number of elements in the range [first, last +1) C++ Code > The count if algorithm counts the number of elements in the range [first, last) C++ Code > Algorithm equal - Compares two sequences to see if they match. C++ Code > Algorithm equal range - Returns the lower and upper bounds within a range. C++ Code > Algorithm fill - Initializes every item in a range to value. C++ Code > Algorithm fill n - Assign n items to value, starting at position first. C++ Code > The find algorithm locates the first element in the range [first, last) C++ Code > Find end algorithm locates, within the range [first1, last1), the last element C++ Code > Find first of algorithm locates, within the range [first1, last1), the first element C++ Code > The find if algorithm locates the first element in the range [first, last) C++ Code > The for each algorithm calls Function F for each element in the range [first, last) C++ Code > The generate algorithm traverses the range [first,last), assigning to each element C++ Code > The generate n algorithm traverses the range [first, first + n), assigning to each C++ Code > Includes algorithm searches for one sequence of values in another sequence of values C++ Code > The inplace merge algorithm merges two sorted sub-sequences: [first..middle) and C++ Code > The iter swap algorithm swaps two elements represented by two iterators. C++ Code > Algorithm lexicographical compare - Lexicographically compare two sequences. C++ Code > The lower bound algorithm returns the first location in the sequence that value C++ Code > Algorithm make heap - A heap is a sequence of elements organized like a binary tree C++ Code > Algorithm max - Returns the maximum of the two items. C++ Code > Max element algorithm returns the location of the maximum element in the sequence C++ Code > The merge algorithm merges two sorted sequences: [first1..last1) and [first2..last2) C++ Code > Algorithm min - Returns the minimum of the two items. C++ Code > The min element algorithm returns the location of the minimum element C++ Code > Algorithm mismatch - Search two sequences for a mismatched item. C++ Code > The next permutation algorithm changes the order of the elements in the range C++ Code > The nth element algorithm partitions the sequence [first..last) on the value C++ Code > The partial sort algorithm sorts the smallest N elements, where N = middle - first C++ Code > The partial sort copy algorithm sorts the smallest N elements, where N = min C++ Code > The partition algorithm arranges elements in the range [first, last) such that C++ Code > Algorithm pop heap - A heap is a sequence of elements organized like a binary tree C++ Code > The prev permutation algorithm changes the order of the elements the range C++ Code > Algorithm push heap - A heap is a sequence of elements organized like a binary tree C++ Code > The random shuffle algorithm shuffles the elements of a sequence C++ Code > Remove algorithm removes all elements that match value from the range (first, last) C++ Code > Remove copy algorithm copies all elements from the range (first, last) to the range C++ Code > The remove copy if algorithm copies all elements from the range (first, last) C++ Code > The remove if algorithm removes all elements from the range (first, last) that cause C++ Code > The replace algorithm replaces all elements that match old value from the range C++ Code > The replace copy algorithm copies all elements from the range [first, last) C++ Code > The replace copy if algorithm copies all elements from the range [first, last) to C++ Code > The replace if algorithm replaces all elements from the range [first, last) C++ Code > The reverse algorithm reverses the order of the elements in the range [first, last) C++ Code > Reverse copy algorithm reverses the order of the elements in the range [first, last) C++ Code > Rotate algorithm rotates the elements in the range [first, last) to the right by N C++ Code > The rotate copy algorithm rotates the elements in the range C++ Code > Algorithm search - search checks whether the sequence in the second range C++ Code > Algorithm search n searches for a sequence of equal values. C++ Code > Set difference - Creates a sorted set of elements in the first set that are not in C++ Code > The intersection of two sets is the set of elements they have in common. C++ Code > Set symmetric difference - Creates a sorted set of elements in the first set, Page 1 Page 2 Page 3 Page 4 Page 5 Page 6