public class CountingSort
{
    private int sortRange;      // Los enteros i que se ordenarán en el rango 0<=i<sortRange
    
    public CountingSort( int range )
    {
        sortRange = range;
    }
    
    public void sort( Object[] d )
    {
        int [] iArray = new int[ d.length ];
        int [] hist = new int[ sortRange ];
        int i;
        
        for ( i = 0; i < sortRange; i++ )
        {
            hist[ i ] = 0;
        }
        for ( i = 0; i< d.length; i++ )
        {
            iArray[ i ] = (( Integer ) d[ i ]).intValue();
        }
        for ( i = 0; i < iArray.length; i++ )
        {
            hist[ iArray[ i ]]++;
        }
        for ( i = 1; i< sortRange; i++ )
        {
            hist[ i ] += hist[ i - 1 ];
        }
        for ( i = iArray.length - 1; i >= 0; i-- )
        {
            d[ hist[ iArray[ i ]] - 1] = new Integer( iArray[ i ] );
            hist[ iArray[ i ]]--;
        }
    }
}