ding.java

class Ding
{
    public static int[][] splitInBuckets(int min, int max, int nBuckets, int[] arr) throws Exception
    {
        if (min < 0)
        {
            throw new Exception("min cannot be smaller than 0");
        }
        int[][] output = new int[nBuckets][];
        int[] distribution = new int[nBuckets];
        int[] found = new int[nBuckets];
        int useMin = min == 0 ? 1 : min;

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

            for (int j = 0; j < nBuckets; j++)
            {
                if (
                        (arr[i] >= (j*useMin)) && (arr[i] <= (int) Math.ceil(max/nBuckets))
                )
                {
                    distribution[j]++;
                    break;
                }
            }
        }

        for (int i = 0; i < nBuckets; i++)
        {
            distribution = new int[distribution[i]];
        }

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

            for (int j = 0; j < nBuckets; j++)
            {
                if (
                        (arr[i] >= (j*useMin)) && (arr[i] <= (int) Math.ceil(max/nBuckets))
                )
                {
                    output[j][found[j]] = arr[i];
                    found[j]++;
                    break;
                }
            }
        }

        return output;
    }
}