排序算法

最新推荐文章于 2024-09-27 14:28:55 发布

J_Factory

最新推荐文章于 2024-09-27 14:28:55 发布

阅读量303

点赞数

分类专栏：算法实现文章标签：算法 random string class

本文链接：https://blog.csdn.net/J_Factory/article/details/2581402

版权

算法实现专栏收录该内容

1 篇文章 0 订阅

订阅专栏

blic class MarquisSort

{

    private static int[] resultData;
    public static void main( String[] args )

    {
        int MAX = 10000000;
        int[] nums = new int[ MAX ];
        Random r = new Random( 20080623 );
        for( int i = 0; i < MAX; i++ )
        {
            nums[ i ] = r.nextInt( MAX );
        }
        long begin = System.currentTimeMillis();
        int[] data = sort( nums );    //排序结果
        long end = System.currentTimeMillis();
        System.out.println( ( end - begin ) ); //排序时间
    }



    public static int[] sort( int[] nums )

    {
        resultData = new int[nums.length];

        countingSort( nums, resultData, getMaxInt( nums ) );

        return resultData;
    }

    

    private static int getMaxInt( int[] data )

    {
        int max = 0;

        for( int i : data )

        {

            if( i > max )

            {

                max = i;

            }

        }

        return max;

    }

    private static void countingSort( int[] oriData, int[] resultData, int k )

    {

        int[] assistData = new int[ k + 1 ];

        

        for( int i = 0; i < assistData.length ; i++ )

        {

            assistData[ i ] = 0;

        }

        

        for( int j = 0; j < oriData.length ; j++ )

        {

            assistData[ oriData[ j ] ] = assistData[ oriData[ j ] ] + 1;

        }



        for( int i = 1; i < assistData.length ; i++ )

        {

            assistData[ i ] = assistData[ i ] +  assistData[ i - 1 ];

        }



        for( int j = oriData.length - 1  ; j >= 0 ; j-- )

        {

            resultData[ assistData[ oriData[ j ] ] - 1 ] = oriData[ j ];

            assistData[ oriData[ j ] ] = assistData[ oriData[ j ] ] - 1;

        }    

    }



}