C# 桶排序双精度实现方案

// See https://aka.ms/new-console-template for more information

using System.Runtime.CompilerServices;

double[] array = { 0.43, 0.69, 0.11, 0.72, 0.28, 0.21, 0.56, 0.80, 0.48, 0.94, 0.32, 0.08 };//12

BucketSort(array, 10);
ShowSord(array);
Console.ReadKey();

static void ShowSord(double[] array)
{
    foreach (var num in array)
    {
        Console.WriteLine($"{num}");
    }
    Console.WriteLine();
}


static void BucketSort(double[] array, int buckerNum)
{
    //创建bucker时，在二维中增加一组标识位，其中bucket[x,0]表示这一维所包含的数字的个数
    //通过这样的技巧可以少写很多代码
    double[,] bucket = new double[buckerNum, array.Length + 1];
    foreach (var num in array)
    {
        int bit = (int)(10 * num);
        bucket[bit, (int)++bucket[bit, 0]] = num;
    }

    //为桶里的每一行使用插入排序
    for (int j = 0; j < buckerNum; j++)
    {
        //为桶里的行创建新的数组后使用插入排序
        double[] insertion = new double[(int)bucket[j, 0]];
        for (int k = 0; k < insertion.Length; k++)
        {
            insertion[k] = bucket[j, k + 1];
        }

        //插入排序
        StraightInsertionSort(insertion);

        //把排好序的结果会写到桶里
        for (int k = 0; k < insertion.Length; k++)
        {
            bucket[j, k + 1] = insertion[k];
        }
    }

    //将所有桶里的数据回写到原数组中
    for (int count = 0, j = 0; j < buckerNum; j++)
    {
        for (int k = 1; k <= bucket[j, 0]; k++)
        {
            array[count++] = bucket[j, k];
        }
    }
}

static void StraightInsertionSort(double[] array)
{
    //插入排序
    for (int i = 1; i < array.Length; i++)
    {
        double sentinel = array[i];
        int j = i - 1;
        while (j >= 0 && sentinel < array[j])
        {
            array[j + 1] = array[j];
            j--;
        }
        array[j + 1] = sentinel;
    }
}