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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
// 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]
namespace Benchstone.BenchI
{
public static class QuickSort
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 80000;
#endif
const int MAXNUM = 200;
const int MODULUS = 0x20000;
const int C = 13849;
const int A = 25173;
static int s_seed = 7;
static int Random(int size) {
unchecked {
s_seed = s_seed * A + C;
}
return (s_seed % size);
}
static void Quick(int lo, int hi, int[] arr) {
int i, j;
int pivot, temp;
if (lo < hi) {
for (i = lo, j = hi, pivot = arr[hi]; i < j;) {
while (i < j && arr[i] <= pivot){
++i;
}
while (j > i && arr[j] >= pivot) {
--j;
}
if (i < j) {
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
// need to swap the pivot and a[i](or a[j] as i==j) so
// that the pivot will be at its final place in the sorted array
if (i != hi) {
temp = arr[i];
arr[i] = pivot;
arr[hi] = temp;
}
Quick(lo, i - 1, arr);
Quick(i + 1, hi, arr);
}
}
[MethodImpl(MethodImplOptions.NoInlining)]
static bool Bench() {
int[] buffer = new int[MAXNUM];
for (int j = 0; j < MAXNUM; ++j) {
int temp = Random(MODULUS);
if (temp < 0){
temp = (-temp);
}
buffer[j] = temp;
}
Quick(0, MAXNUM - 1, buffer);
for (int j = 0; j < MAXNUM - 1; ++j) {
if (buffer[j] > buffer[j+1]) {
return false;
}
}
return true;
}
[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);
}
}
}
|
