2.1.38 #

解答 #

这里实现了一个 Pair 类，用来排序。
每一个元素都有相应的 key 值和 value 值，排序时只使用 key 值进行排序。
代码 #

var n = 10000;
var results = TestA(n);
Console.WriteLine("string + double");
Console.WriteLine("Insertion Sort:" + results[0]);
Console.WriteLine("Selection Sort:" + results[1]);
Console.WriteLine("Shell Sort:" + results[2]);
results = TestB(n);
Console.WriteLine("double + 10 string");
Console.WriteLine("Insertion Sort:" + results[0]);
Console.WriteLine("Selection Sort:" + results[1]);
Console.WriteLine("Shell Sort:" + results[2]);
results = TestC(n);
Console.WriteLine("int + int[]");
Console.WriteLine("Insertion Sort:" + results[0]);
Console.WriteLine("Selection Sort:" + results[1]);
Console.WriteLine("Shell Sort:" + results[2]);

// 第一个测试，测试结果按照 Insertion, Selection, Shell 排序。
static double[] TestA(int n)
{
    var insertionSort = new InsertionSort();
    var selectionSort = new SelectionSort();
    var shellSort = new ShellSort();

    var random = new Random();

    // 每个元素的主键均为 String 类型（至少长 10 个字符），并含有一个 double 值。
    var array = new Pair<string, double>[n];
    var arrayBak = new Pair<string, double>[n];
    for (var i = 0; i < n; i++)
    {
        array[i] = new Pair<string, double>(RandomString(20, random), random.NextDouble());
    }

    array.CopyTo(arrayBak, 0);

    var results = new double[3];
    results[0] = SortCompare.Time(insertionSort, array);
    arrayBak.CopyTo(array, 0);
    results[1] = SortCompare.Time(selectionSort, array);
    arrayBak.CopyTo(array, 0);
    results[2] = SortCompare.Time(shellSort, array);
    return results;
}

// 第二个测试，测试结果按照 Insertion, Selection, Shell 排序。
static double[] TestB(int n)
{
    var insertionSort = new InsertionSort();
    var selectionSort = new SelectionSort();
    var shellSort = new ShellSort();

    var random = new Random();

    // 每个元素的主键均为 double 类型，并含有 10 个 String 值（每个都至少长 10 个字符）。
    var array = new Pair<double, string[]>[n];
    var arrayBak = new Pair<double, string[]>[n];
    for (var i = 0; i < n; i++)
    {
        var temp = new string[10];
        for (var j = 0; j < 10; j++)
        {
            temp[j] = RandomString(12, random);
        }

        array[i] = new Pair<double, string[]>(random.NextDouble(), temp);
    }

    array.CopyTo(arrayBak, 0);

    var results = new double[3];
    results[0] = SortCompare.Time(insertionSort, array);
    arrayBak.CopyTo(array, 0);
    results[1] = SortCompare.Time(selectionSort, array);
    arrayBak.CopyTo(array, 0);
    results[2] = SortCompare.Time(shellSort, array);
    return results;
}

// 第三个测试，测试结果按照 Insertion, Selection, Shell 排序。
static double[] TestC(int n)
{
    var insertionSort = new InsertionSort();
    var selectionSort = new SelectionSort();
    var shellSort = new ShellSort();

    var random = new Random();

    // 每个元素的主键均为 int 类型，并含有一个 int[20] 值。
    var array = new Pair<int, int[]>[n];
    var arrayBak = new Pair<int, int[]>[n];
    for (var i = 0; i < n; i++)
    {
        var temp = new int[20];
        for (var j = 0; j < 20; j++)
        {
            temp[j] = random.Next();
        }

        array[i] = new Pair<int, int[]>(random.Next(), temp);
    }

    array.CopyTo(arrayBak, 0);

    var results = new double[3];
    results[0] = SortCompare.Time(insertionSort, array);
    arrayBak.CopyTo(array, 0);
    results[1] = SortCompare.Time(selectionSort, array);
    arrayBak.CopyTo(array, 0);
    results[2] = SortCompare.Time(shellSort, array);
    return results;
}

// 获取一个随机 string
static string RandomString(int n, Random random)
{
    var value = new char[n];
    for (var i = 0; i < n; i++)
    {
        value[i] = (char)random.Next(char.MinValue + 10, char.MaxValue - 10);
    }

    return new string(value);
}
另请参阅 #

Sort 库