#include <algorithm>
#include <boost/tr1/array.hpp>
using std::tr1::array;
#define BOOST_AUTO_TEST_MAIN
#include <boost/test/auto_unit_test.hpp>
template<class Iterator>
void bubble_sort( Iterator First, Iterator Last )
{
    // TODO
}
BOOST_AUTO_TEST_CASE( bubble_sort_simple )
{
    array< int, 10 > a0 = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
    array< int, 10 > a1 = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
    std::random_shuffle( a0.begin(), a0.end() );
    bubble_sort( a0.begin(), a0.end() );
    BOOST_CHECK_EQUAL( a0 == a1, true );
}
BOOST_AUTO_TEST_CASE( bubble_sort_1_elem )
{
    array< int, 1 > a0 = { 0 };
    array< int, 1 > a1 = { 0 };
    std::random_shuffle( a0.begin(), a0.end() );
    bubble_sort( a0.begin(), a0.end() );
    BOOST_CHECK_EQUAL( a0 == a1, true );
}
BOOST_AUTO_TEST_CASE( bubble_sort_2_elem )
{
    array< int, 2 > a0 = { 0, 1 };

    array< int, 2 > a1 = { 0, 1 };
    std::random_shuffle( a0.begin(), a0.end() );
    bubble_sort( a0.begin(), a0.end() );
    BOOST_CHECK_EQUAL( a0 == a1, true );
}
BOOST_AUTO_TEST_CASE( bubble_sort_empty )
{
    array< int, 0 > a0 = {};
    array< int, 0 > a1 = {};
    std::random_shuffle( a0.begin(), a0.end() );
    bubble_sort( a0.begin(), a0.end() );
    BOOST_CHECK_EQUAL( a0 == a1, true );
}

        // simple sort procedure
        private void doSortArray(int[] largest, int size)
        {
            for (int i = 0; i < size; ++i)
            {
                for ( int j = i+1; j < size; ++j)
                {
                    if (largest[ i ] < largest[j])
                    {
                        int temp = largest[ i ];
                        largest[ i ] = largest[j];
                        largest[j] = temp;
                    }
                }
            }
        }

И заняло это не более трех минут... ;-)

template<class Iterator>
void bubble_sort( Iterator First, Iterator Last )
{
    for( --Last; First < Last; ++First )
        for( Iterator i = Last; i > First; --i )
            if ( *i < *(i - 1) )
                std::iter_swap( (i - 1), i );
}

template<class Iterator>
void insertion_sort( Iterator First, Iterator Last )
{
    for( Iterator i = First; i < Last; ++i )
        for( Iterator j = i; j > First && *j < *(j - 1); --j )
            std::iter_swap( (j - 1), j );
}