kmc7468/cs420
1
0
Fork 0
mirror of https://github.com/kmc7468/cs420.git synced 2025-12-16 07:28:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update benchmarks

Browse Source
This commit is contained in:
Minseong Jang
2025-06-13 15:19:21 +09:00
parent 49410f5264
commit 1aa18bce30
11 changed files with 201 additions and 193 deletions
Download Patch File Download Diff File Expand all files Collapse all files

52
bench/fibonacci.c
View File

@@ -1,36 +1,36 @@
int fibonacci_loop(int n, int nonce) {
int result = 0;
int result = 0;
for (int step = 0; step < 10; ++step) {
int x = nonce;
int y = nonce;
for (int step = 0; step < 10; ++step) {
int x = nonce;
int y = nonce;
for (int i = 1; i < n; ++i) {
int newy = x + y;
newy += (x + y);
newy += (x + y);
newy += (x + y);
newy += (x + y);
newy += (x + y);
newy -= (x + y);
newy -= (x + y);
newy -= (x + y);
newy -= (x + y);
newy -= (x + y);
x = y;
y = newy;
for (int i = 1; i < n; ++i) {
int newy = x + y;
newy += (x + y);
newy += (x + y);
newy += (x + y);
newy += (x + y);
newy += (x + y);
newy -= (x + y);
newy -= (x + y);
newy -= (x + y);
newy -= (x + y);
newy -= (x + y);
x = y;
y = newy;
}
result += y;
}
result += y;
}
return result;
return result;
}
int fibonacci_recursive(int n, int nonce) {
if (n < 2) {
return nonce;
}
if (n < 2) {
return nonce;
}
return fibonacci_recursive(n - 1, nonce) + fibonacci_recursive(n - 2, nonce);
return fibonacci_recursive(n - 1, nonce) + fibonacci_recursive(n - 2, nonce);
}