blob: 78626fffc94df2f96e97bed4b2d8dc4c303bc0c0 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
//
using Microsoft.Xunit.Performance;
using System;
using System.Runtime.CompilerServices;
using Xunit;
[assembly: OptimizeForBenchmarks]
[assembly: MeasureInstructionsRetired]
public static class BubbleSort
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 55000;
#endif
static void SortArray(int[] tab, int last) {
bool swap;
int temp;
do {
swap = false;
for (int i = 0; i < last; i++) {
if (tab[i] > tab[i + 1]) {
temp = tab[i];
tab[i] = tab[i + 1];
tab[i + 1] = temp;
swap = true;
}
}
}
while (swap);
}
static bool VerifySort(int[] tab, int last) {
for (int i = 0; i < last; i++) {
if (tab[i] > tab[i + 1]) {
return false;
}
}
return true;
}
[MethodImpl(MethodImplOptions.NoInlining)]
static public bool Bench() {
int[] tab = new int[100];
int k = 0;
for (int i = 9; i >= 0; i--) {
for (int j = i * 10; j < (i + 1) * 10; j++) {
tab[k++] = ((j & 1) == 1) ? j + 1 : j - 1;
}
}
SortArray(tab, 99);
bool result = VerifySort(tab, 99);
return result;
}
[Benchmark]
public static void Test() {
foreach (var iteration in Benchmark.Iterations) {
using (iteration.StartMeasurement()) {
for (int i = 0; i < Iterations; i++) {
Bench();
}
}
}
}
static bool TestBase() {
bool result = true;
for (int i = 0; i < Iterations; i++) {
result &= Bench();
}
return result;
}
public static int Main() {
bool result = TestBase();
return (result ? 100 : -1);
}
}
|
