手写三种sort算法

最近要找工作，于是手写了stl风格的三种sort算法，quick sort，merge sort和heap sort，其中quick sort分别实现了递归和非递归两种，代码如下 ，经过了基本的正确性测试（不保证对所有类型都正确，因为没充分测试过），然后性能测试与C++的std::sort和std::stable_sort做了一些对比 代码如下：

 

#include <algorithm> #include <stack> #include <cassert> #include <utility> namespace fatrat { using std::iterator_traits; enum{ _INSERT_SORT_THRESHOLD = 7,_QUICK_SORT_THRESHOLD = 16 }; template<typename _RandomAccessIterator,typename _Compare> void insertion_sort(_RandomAccessIterator first,_RandomAccessIterator last, _Compare comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; if( first == last ) return; for( _RandomAccessIterator iter = first+1; iter != last; ++iter ){ _ValueType val = *iter; if( comp(val,*first) == true ){ std::copy_backward(first,iter,iter+1); *first = val; }else{ _RandomAccessIterator next,current; next = current = iter; --next; while( comp(val,*next) == true ){ *current = *next; current = next; --next; } *current = val; } } } template<typename _RandomAccessIterator> void insertion_sort(_RandomAccessIterator first,_RandomAccessIterator last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; if( first == last ) return; for( _RandomAccessIterator iter = first+1; iter != last; ++iter ){ _ValueType val = *iter; if( val < *first ){ std::copy_backward(first,iter,iter+1); *first = val; }else{ _RandomAccessIterator next,current; current = next = iter; --next; while( val < *next ){ *current = *next; current = next; --next; } *current = val; } } } / template<typename _RandomAccessIterator,typename _RandomAccessIterator2,typename _Compare> void merge_intervals(_RandomAccessIterator first1, _RandomAccessIterator last1, _RandomAccessIterator first2,_RandomAccessIterator last2, _RandomAccessIterator2 result,_Compare comp) { while( first1 < last1 && first2 < last2 ){ if( comp(*first1,*first2) == true ){ *result = *first1; ++first1; } else{ *result = *first2; ++first2; } ++result; } while( first1 < last1 ){ *result = *first1; ++first1; ++result; } while( first2 < last2 ){ *result = *first2; ++first2; ++result; } } template<typename _RandomAccessIterator,typename _RandomAccessIterator2> void merge_intervals(_RandomAccessIterator first1, _RandomAccessIterator last1, _RandomAccessIterator first2,_RandomAccessIterator last2, _RandomAccessIterator2 result) { while( first1 < last1 && first2 < last2 ){ if( *first1 < * first2 ){ *result = *first1; ++first1; } else{ *result = *first2; ++first2; } ++result; } while( first1 < last1 ){ *result = *first1; ++first1; ++result; } while( first2 < last2 ){ *result = *first2; ++first2; ++result; } } template<typename _RandomAccessIterator,typename _RandomAccessIterator2,typename _Compare> void merge_sort_with_buffer(_RandomAccessIterator first, _RandomAccessIterator last,_RandomAccessIterator2 result,_Compare comp)