-
Notifications
You must be signed in to change notification settings - Fork 149
Expand file tree
/
Copy pathfibonacci.py
More file actions
60 lines (51 loc) · 1.96 KB
/
fibonacci.py
File metadata and controls
60 lines (51 loc) · 1.96 KB
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
# Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
# DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
#
# This code is free software; you can redistribute it and/or modify it
# under the terms of the GNU General Public License version 2 only, as
# published by the Free Software Foundation. Oracle designates this
# particular file as subject to the "Classpath" exception as provided
# by Oracle in the LICENSE file that accompanied this code.
#
# This code is distributed in the hope that it will be useful, but WITHOUT
# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
# FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
# version 2 for more details (a copy is included in the LICENSE file that
# accompanied this code).
#
# You should have received a copy of the GNU General Public License version
# 2 along with this work; if not, write to the Free Software Foundation,
# Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
#
# Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
# or visit www.oracle.com if you need additional information or have any
# questions.
# Used in the polybench harness as the default number of warmup iterations
# for this benchmark.
def warmupIterations():
return 10
# Used in the polybench harness as the default number of iterations for
# this benchmark.
def iterations():
return 30
# Used in the polybench harness for aggregating the iteration datapoints.
def summary():
return {
"name": "OutlierRemovalAverageSummary",
"lower-threshold": 0,
"upper-threshold": 0.3,
}
def fibonacci(n):
if n < 1:
return 0
if n <= 2:
return 1
return fibonacci(n - 1) + fibonacci(n - 2)
def run():
number = 31
fibo_is = 1346269
fibo = fibonacci(number)
if fibo != fibo_is:
raise AssertionError(f"Unexpected result: {fibo}")
__graalpython__.dump_heap()
return fibo