template <class T> void Quicksort( T tab[], T left, T right )
{
    int i = left;
    int j = right;
    int x = tab[( left + right ) / 2 ];
    do
    {
        while( tab[ i ] < x )
             i++;

        while( tab[ j ] > x )
             j--;

        if( i <= j )
        {
            std::swap( tab[ i ], tab[ j ] );

            i++;
            j--;
        }
    } while( i <= j );

    if( left < j ) Quicksort( tab, left, j );

    if( right > i ) Quicksort( tab, i, right );

}
**********************
template <class C> void SortowanieWybieranie( C tab[], C size )
{
    int k;
    for( int i = 0; i < size; i++ )
    {
        k = i;
        for( int j = i + 1; j < size; j++ )
        if( tab[ j ] < tab[ k ] )
             k = j;

        std::swap( tab[ k ], tab[ i ] );
    }
}