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

C++ nth_element 以 range 中的 nth 元素为基准的排序。默认情况是按升序将序列进行排序。 template class RandomAccessIterator void nth_element ( RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last ); template class RandomAccessIterator, class Comapre void nth_element ( RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp ); Sort element in range Rearranges the elements in the range [first,last), in such a way that the element at the resulting nth position is the element that would be in that position in a sorted sequence, with all the elements preceding it being smaller and all the elements following it greater than it. Neither the elements preceding it nor the elements following it are granted to be ordered. The elements are compared usingoperator for the first version, andcomp for the second. Parameters first, last Random-Access iterators to the initial and final positions of the sequence to be used. The range used is[first,last), which contains all the elements betweenfirst and last, including the element pointed by first but not the element pointed by last. Notice that in this function, these are not consecutive parameters, but the first and third ones. nth  Random-Access iterator pointing to the location within the range [first,last) that will have the sorted element. comp  Comparison function object that, taking two values of the same type than those contained in the range, returns true if the first argument goes before the second argument in the specific strict weak ordering it defines, and false otherwise. Return value none Example // nth_element example #include iostream #include algorithm #include vector using namespace std; bool myfunction (int i,int j) { return (ij); } int main () { vectorint myvector; vectorint::iterator it; // set some values: for (int i=1; i10; i++) myvector.push_back(i); // 1 2 3 4 5 6 7 8 9 random_shuffle (myvector.begin(), myvector.end()); // using default comparison (operator ): nth_element (m