fig07_03.cpp

经典书籍源代码啊。。。第三版。。。数据结构与算法分析——C++描述(第3版).

template <typename Iterator>
void insertionSort( const Iterator & begin, const Iterator & end )
{
    if( begin != end )
        insertionSortHelp( begin, end, *begin );
}


template <typename Iterator, typename Object>
void insertionSortHelp( const Iterator & begin, const Iterator & end,
                        const Object & obj )
{
    insertionSort( begin, end, less<Object>( ) );
}