C++ min_element分析和总结最新分析和总结.docxVIP

C++ min_element template class ForwardIterator ForwardIterator min_element ( ForwardIterator first, ForwardIterator last ); template class ForwardIterator, class Compare ForwardIterator min_element ( ForwardIterator first, ForwardIterator last, Compare comp ); Return smallest element in range Returns an iterator pointing to the element with the smallest value in the range [first,last). The comparisons are performed using eitheroperator for the first version, orcomp for the second; An element is the smallest if no other element compares less than it (it may compare equal, though). The behavior of this function template is equivalent to: template template class ForwardIterator ForwardIterator min_element ( ForwardIterator first, ForwardIterator last ) { ForwardIterator lowest = first; if (first==last) return last; while (++first!=last) if (*first*lowest) // or: if (comp(*first,*lowest)) for the comp version lowest=first; return lowest; } Parameters first, last Input iterators to the initial and final positions of the sequence to use. The range used is [first,last), which contains all the elements between first and last, including the element pointed by first but not the element pointed by last. comp  Comparison function object that, taking two values of the same type than those contained in the range, returns true if the first argument is to be considered less than the second argument, and false otherwise. Return value Iterator to smallest value in the range. Example // min_element/max_element #include iostream #include algorithm using namespace std; bool myfn(int i, int j) { return ij; } struct myclass { bool operator() (int i,int j) { return ij; } } myobj; int main () { int myints[] = {3,7,2,5,6,4,9}; // using default comparison: cout The smallest element is *min_element(myints,myints+7) endl; cout The largest element is *max_element(myints,myints+7) endl; // using function myfn as comp: cout The smallest element is *min_element(myints,myints+7,myfn) e