码迷,mamicode.com
首页 > 编程语言 > 详细

排序算法

时间:2015-12-24 14:48:50      阅读:245      评论:0      收藏:0      [点我收藏+]

标签:

排序算法

排序算法

Table of Contents

1 桶排序

import java.util.*;
class Sort
{
    public static void main(String args[])
    {
        Random rand= new Random();
        final int DATA_SCOPE=10;//every num is a integer and will range from 0~data_scope
        final int INPUT_SIZE=10;
        int[]arr= new int[INPUT_SIZE];
        for (int i = 0; i < arr.length; i++) {
            arr[i]=rand.nextInt(DATA_SCOPE);
        }
        prArr(arr);
        bucketSort(arr,DATA_SCOPE);
    }


    public static void prArr(int[]arr)
    {
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+" ");
        }
        System.out.println();
    }

    public static void bucketSort(int[]arr,int data_scope) {
        final int bucketSize=data_scope;
        int buckets[]=new int[bucketSize];
        //put into buckets
        for (int i = 0; i < arr.length;i++)
            {
                buckets[arr[i]]++;
            }

        for (int i = 0; i < bucketSize;i++)
            {
                for (int j = 0; j < buckets[i]; j++) {
                    System.out.print(i+" ");
                }
            }
        System.out.println("");

    }


}

Author: lexnewgate

Created: 2015-12-24 周四 13:27

Emacs 24.5.1 (Org mode 8.2.10)

Validate

排序算法

标签:

原文地址:http://www.cnblogs.com/AlexWei/p/5072749.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!