-
Notifications
You must be signed in to change notification settings - Fork 0
/
CompletedBenchmarkTool.java
189 lines (143 loc) · 5.67 KB
/
CompletedBenchmarkTool.java
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
//package edu.ser222.m02_01;
import java.util.Random;
/**
* (basic description of the program or class)
*
* Completion time: (estimation of hours spent on this program)
*
* @author Robert, Acuna, Sedgewick
* @version 1.0
*/
public class CompletedBenchmarkTool implements BenchmarkTool {
/***************************************************************************
* START - SORTING UTILITIES, DO NOT MODIFY (FROM SEDGEWICK) *
**************************************************************************/
public static void insertionSort(Comparable[] a) {
int N = a.length;
for (int i = 1; i < N; i++)
{
// Insert a[i] among a[i-1], a[i-2], a[i-3]... ..
for (int j = i; j > 0 && less(a[j], a[j-1]); j--)
exch(a, j, j-1);
}
}
public static void shellsort(Comparable[] a) {
int N = a.length;
int h = 1;
while (h < N/3) h = 3*h + 1; // 1, 4, 13, 40, 121, 364, 1093, ...
while (h >= 1) {
// h-sort the array.
for (int i = h; i < N; i++) {
// Insert a[i] among a[i-h], a[i-2*h], a[i-3*h]... .
for (int j = i; j >= h && less(a[j], a[j-h]); j -= h)
exch(a, j, j-h);
}
h = h/3;
}
}
private static boolean less(Comparable v, Comparable w) {
return v.compareTo(w) < 0;
}
private static void exch(Comparable[] a, int i, int j) {
Comparable t = a[i]; a[i] = a[j]; a[j] = t;
}
/***************************************************************************
* END - SORTING UTILITIES, DO NOT MODIFY *
**************************************************************************/
//TODO: implement interface methods.
public Integer[] generateTestDataBinary(int size) {
Integer[] data = new Integer[size];
int half = size/2;
for (int i = 0; i < half; i++) {
data[i] = 0;
}
for (int i = half; i < size; i++) {
data[i] = 1;
}
return data;
}
public Integer[] generateTestDataHalves(int size) {
Integer[] data = new Integer[size];
int half = size/2;
int value = 0;
int index = 0;
while (half != 1) {
for (int i = index; i < (size - half); i++) {
data[i] = value;
index = i;
}
half = half/2;
index++;
value++;
}
data[index] = value;
++index; ++value;
data[index] = value;
return data;
}
public Integer[] generateTestDataHalfRandom(int size) {
Integer[] data = new Integer[size];
Random random = new Random();
int half = size/2;
for (int i = 0; i < half; i++) {
data[i] = 0;
}
for (int i = half; i < size; i++) {
data[i] = random.nextInt(Integer.MAX_VALUE);
}
return data;
}
public double computeDoublingFormula(double t1, double t2) {
double b = Math.log(t2/t1) / Math.log(2);
return b;
}
public double benchmarkInsertionSort(Integer[] small, Integer[] large) {
double run1, run2, result;
Stopwatch stopwatch1 = new Stopwatch();
insertionSort(small);
run1 = stopwatch1.elapsedTime();
Stopwatch stopwatch2 = new Stopwatch();
insertionSort(large);
run2 = stopwatch2.elapsedTime();
result = computeDoublingFormula(run1, run2);
return result;
}
public double benchmarkShellsort(Integer[] small, Integer[] large) {
double run1, run2, result;
Stopwatch stopwatch1 = new Stopwatch();
shellsort(small);
run1 = stopwatch1.elapsedTime();
Stopwatch stopwatch2 = new Stopwatch();
shellsort(large);
run2 = stopwatch2.elapsedTime();
result = computeDoublingFormula(run1, run2);
return result;
}
public void runBenchmarks(int size) {
Integer[] dataset1a = generateTestDataBinary(size);
Integer[] dataset1b = generateTestDataBinary(size*2);
Integer[] dataset2a = generateTestDataHalves(size);
Integer[] dataset2b = generateTestDataHalves(size*2);
Integer[] dataset3a = generateTestDataHalfRandom(size);
Integer[] dataset3b = generateTestDataHalfRandom(size*2);
double insertionResult1, insertionResult2, insertionResult3;
double shellResult1, shellResult2, shellResult3;
insertionResult1 = benchmarkInsertionSort(dataset1a, dataset1b);
insertionResult2 = benchmarkInsertionSort(dataset2a, dataset2b);
insertionResult3 = benchmarkInsertionSort(dataset3a, dataset3b);
shellResult1 = benchmarkShellsort(dataset1a, dataset1b);
shellResult2 = benchmarkShellsort(dataset2a, dataset2b);
shellResult3 = benchmarkShellsort(dataset3a, dataset3b);
System.out.println(" Insertion Shellsort");
System.out.printf("Bin %5.3f %5.3f%n", insertionResult1, shellResult1);
System.out.printf("Half %5.3f %5.3f%n", insertionResult2, shellResult2);
System.out.printf("RanInt %5.3f %5.3f%n", insertionResult3, shellResult3);
}
public static void main(String args[]) {
BenchmarkTool me = new CompletedBenchmarkTool();
int size = 4096*2;
//NOTE: feel free to change size here. all other code must go in the
// methods.
me.runBenchmarks(size);
}
}