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

C++ merge() merge()合并两个有序序列，并排序。 该函数默认是降序的，如果两个序列为升序，需要定义 comp()， 否则则当成非排序序列处理，直接将两个序列合并。 template class InputIterator1, class InputIterator2, class OutputIterator OutputIterator ( InputIterator1 first1, InputIterator1 last1, InputIterator2 last2, InputIterator2 first2, OutputIterator result ); template class InputIterator1, class InputIterator2, class OutputIterator, class Compare OutputIterator ( InputIterator1 first1, InputIterator1 last1, InputIterator2 last2, comp ); sorted ranges InputIterator2 first2, OutputIterator result, Compare Combines the elements in the sorted ranges [first1,last1) and [first2,last2), into a new range beginning at result with its elements sorted. The comparison for sorting uses either operator for the first version, or comp for the second. For the function to yield the expected result, the elements in the both ranges shall already be ordered according to the same strict weak ordering criterion ( operator or comp). The resulting range is also sorted according to it. The behavior of this function template is equivalent to: template template class InputIterator1, class InputIterator2, class OutputIterator OutputIterator merge ( InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result ) { while while (true) { *result++ = (*first2*first1)? *first2++ : *first1++; if (first1==last1) return copy(first2,last2,result); if (first2==last2) return copy(first1,last1,result); } } Parameters first1, last1 Input iterators to the initial and final positions of the first sequence. The range used is [first1,last1), which contains all the elements between first1 and last1, including the element pointed by first1 but not the element pointed by last1. first2, last2 Input iterators to the initial and final positions of the second sequence. The range used is [first2,last2). result  Output iterator to the initial position of the range where the resulting combined range is stored. Its length is eq