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

C++ partial_sort_copy 将 range1 中的 range2_n 个元素复制到 range2 中并按 comp()为 true 的方式进行排序，默认按升序排序。 template class InputIterator, class RandomAccessIterator RandomAccessIterator partial_sort_copy ( InputIterator first,InputIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last ); template class InputIterator, class RandomAccessIterator, class Compare RandomAccessIterator partial_sort_copy ( InputIterator first,InputIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp ); Copy and partially sort range Copies the smallest elements in the range [first,last) to [result_first,result_last), sorting the elements copied. The amount of elements copied is (result_last-result_first) (unless this is more than the amount of elements in [first,last)). [first,last) remains unmodified. The elements are compared usingoperator for the first version, andcomp for the second. Parameters first, last Input iterators to the initial and final positions of the sequence to copy from. 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. result_first, result_last Random-Access iterators to the initial and final positions of the destination sequence. The range used is [result_first,result_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 goes before the second argument in the specific strict weak ordering it defines, and false otherwise. Return value none Example // partial_sort_copy example #include iostream #include algorithm #include vector using namespace std; bool myfunction (int i,int j) { return (ij); } int main () { int myints[] = {9,8,7,6,5,4,3,2,1}; vectorint myvector (5); vectorint::iterator it; // using default comparison (operator ): partial_sort_copy (myints, myints+9, myvector.begin(), myvector.end()); // using f