using System;

using System.Linq;

using System.Collections;

using System.Collections.Generic;

using System.Text;

public class Program

{

    public static void Main()

    {

        Console.WriteLine(string.Join(",", bucketSort(new int[]{2,5,4,3,10, 18, 12, 0})));

    }

​

  /**

   * BucketSort algorithms implements

   *

   * @param arr the array contains elements

   */

  private static int[] bucketSort(int[] arr) {

    /* get max value of arr */

    int max = arr.Max();

​

    /* get min value of arr */

    int min = arr.Min();

​

    /* number of buckets */

    int numberOfBuckets = arr.Length;

      int[] newarr = new int[numberOfBuckets];

​

    Dictionary<int, int> buckets = new Dictionary<int, int>();

​

    /* init buckets */

    for (int i = min; i <= max; ++i) {

      buckets.Add(i, 0);

    }

​

    /* store elements to buckets */

    foreach (int value in arr) {

     if(buckets[value] != 0)

      buckets[value] += 1;

        else

            buckets[value] =1;

    }

      int j = 0;

      foreach ( int key in buckets.Keys) {

          if(buckets[key]>0) {

              for(int k=0;k<buckets[key];k++){

                  newarr[j] = key;

                  j++;

              }

          }

      }

​

​

      return newarr;

  }

}