-
Notifications
You must be signed in to change notification settings - Fork 256
/
BubbleSort2.cs
59 lines (52 loc) · 1.53 KB
/
BubbleSort2.cs
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
// 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 BenchmarkDotNet.Attributes;
using MicroBenchmarks;
namespace Benchstone.BenchI
{
[BenchmarkCategory(Categories.Runtime, Categories.Benchstones, Categories.JIT, Categories.BenchI)]
public class BubbleSort2
{
public const int Bound = 500 * 15;
static void Inner(int[] x) {
int limit1 = Bound - 1;
for (int i = 1; i <= limit1; i++) {
for (int j = i; j <= Bound; j++) {
if (x[i] > x[j]) {
int temp = x[j];
x[j] = x[i];
x[i] = temp;
}
}
}
}
// this benchmark is BAD, it should not allocate the array and check the order, but I am porting "as is"
[Benchmark(Description = nameof(BubbleSort2))]
public bool Test() {
int[] x = new int[Bound + 1];
int i, j;
int limit;
j = 99999;
limit = Bound - 2;
i = 1;
do {
x[i] = j & 32767;
x[i + 1] = (j + 11111) & 32767;
x[i + 2] = (j + 22222) & 32767;
j = j + 33333;
i = i + 3;
} while (i <= limit);
x[Bound - 1] = j;
x[Bound] = j;
Inner(x);
for (i = 0; i < Bound - 1; i++) {
if (x[i] > x[i + 1]) {
return false;
}
}
return true;
}
}
}