public void benchmark()
{
const int HeapSize = 5000;
int[] randomValues = Enumerable.Range(0, 100000).Select(_ => _random.Next()).ToArray();
BenchmarkResult r1 = Benchmarker.BenchmarkTime(() =>
{
BestKeeper <int> sut = new BestKeeper <int>(HeapSize, (n1, n2) => n1 - n2);
for (int i = 0; i < randomValues.Length; i++)
{
sut.Add(randomValues[i]);
}
}, 100);
BenchmarkResult r2 = Benchmarker.BenchmarkTime(() =>
{
OrderedArrayBestKeeper <int> sut = new OrderedArrayBestKeeper <int>(HeapSize, (n1, n2) => n1 - n2);
for (int i = 0; i < randomValues.Length; i++)
{
sut.Add(randomValues[i]);
}
}, 100);
Assert.That(r1.IsSignificantlyBetterThan(r2), Is.True);
}
