/// <summary>
/// 对相应排序算法执行一次耗时测试。
/// </summary>
/// <param name="sort">用于测试的排序算法。</param>
/// <param name="a">用于测试的数据。</param>
/// <returns>排序的耗时，单位为毫秒。</returns>
public static double Time <T>(BaseSort sort, T[] a) where T : IComparable <T>
{
var stopwatch = Stopwatch.StartNew();
sort.Sort(a);
return(stopwatch.ElapsedMilliseconds);
}
/// <summary>
/// 对相应排序算法做多次有序数据测试，返回总耗时。
/// </summary>
/// <param name="sort">用于测试的排序算法。</param>
/// <param name="n">每次测试的数据量。</param>
/// <param name="trials">测试次数。</param>
/// <returns>多次排序的总耗时。</returns>
public static double TimeSortedInput(BaseSort sort, int n, int trials)
{
var total = 0.0;
var a = new double[n];
for (var t = 0; t < trials; t++)
{
for (var i = 0; i < n; i++)
{
a[i] = i * 1.0;
}
total += Time(sort, a);
}
return(total);
}
/// <summary>
/// 对相应排序算法做多次随机数据测试，返回总耗时。
/// </summary>
/// <param name="sort">用于测试的排序算法。</param>
/// <param name="n">每次测试的数据量。</param>
/// <param name="trials">测试次数。</param>
/// <returns>多次排序的总耗时。</returns>
public static double TimeRandomInput(BaseSort sort, int n, int trials)
{
var total = 0.0;
var a = new double[n];
var random = new Random();
for (var t = 0; t < trials; t++)
{
for (var i = 0; i < n; i++)
{
a[i] = random.NextDouble();
}
total += Time(sort, a);
}
return(total);
}
