def test_9(self):
if Fibonacci.fibonacciChecker(9) == True:
FibonacciTest.f.write("1,,4\n")
else:
FibonacciTest.f.write(
"0,Unsuccessful normal Fibonacci generation,4\n")
self.assertEqual(Fibonacci.fibonacciChecker(9), True)
def test_13(self):
if Fibonacci.fibonacciChecker(13) == True:
FibonacciTest.f.write("1,,5\n")
else:
FibonacciTest.f.write(
"0,Unsuccessful Fibonacci false positive detection,5\n")
self.assertEqual(Fibonacci.fibonacciChecker(13), True)
def measureTime(n):
total = 0
for i in range(0, 200000):
start_time = time.time()
fib.fibClosedFormula(n)
end_time = time.time()
total += end_time - start_time
return total/200
def test_Fibonacci():
start = time.clock()
for i in range(33):
a = Fibonacci.Fibonacci(i)
b = Fibonacci.Fibonacci(i + 1)
c = Fibonacci.Fibonacci(i + 2)
assert (a + b == c)
elapsed = 1000 * (time.clock() - start)
print('Time elapsed %.4f milliseconds' % elapsed)
print("***PASSED ALL TESTS***")
def testFib(self):
# sequence of size 0
sequence = []
self.assertEqual(sequence, Fibonacci.fibonacci(0))
# sequence of size 1
sequence = [0]
self.assertEqual(sequence, Fibonacci.fibonacci(1))
# sequence of size 2
sequence = [0, 1]
self.assertEqual(sequence, Fibonacci.fibonacci(2))
# sequence of size > 2
sequence = [0, 1, 1, 2, 3, 5]
self.assertEqual(sequence, Fibonacci.fibonacci(6))
def testFibonacci(self):
print("\n%%%%%%% Testing Fibonacci")
expectedResult = 13
result = Fibonacci.fibonacci(8)
print("fibonacci(8)=" + str(result))
self.assertEqual(result, expectedResult, msg="fibonacci(8)")
expectedResult = 610
result = Fibonacci.fibonacci(16)
print("fibonacci(16)=" + str(result))
self.assertEqual(result, expectedResult, msg="fibonacci(16)")
expectedResult = 17711
result = Fibonacci.fibonacci(23)
print("fibonacci(23)=" + str(result))
self.assertEqual(result, expectedResult, msg="fibonacci(23)")
def SumOfEvenValue(self,maxValue):
self.__maxValue = maxValue
self.__fib = Fibonacci(self.__first,self.__second).generate()
while True:
self.__fib_Value = self.__fib.next()
if(self.__fib_Value <= self.__maxValue):
if((self.__fib_Value % 2) == 0):
self.__answer += self.__fib_Value
else:
break
return self.__answer
class testProblem2(unittest.TestCase):
def setUp(self):
self.fib = Fibonacci(1,2).generate()
self.fib_number = [1,2,3,5,8,13,21,34,55,89]
def testFibonacci(self):
for number in range(0,len(self.fib_number)):
self.assertEquals(self.fib.next(),self.fib_number[number])
def testSumOfEvenValue(self):
self.__first = 1
self.__second = 2
self.assertEqual(Problem2(self.__first,self.__second).SumOfEvenValue(10),10)
self.assertEqual(Problem2(self.__first,self.__second).SumOfEvenValue(100),44)
class Problem2(object):
def __init__(self,first,second):
self.__first = first
self.__second = second
self.__answer = 0
def SumOfEvenValue(self,maxValue):
self.__maxValue = maxValue
self.__fib = Fibonacci(self.__first,self.__second).generate()
while True:
self.__fib_Value = self.__fib.next()
if(self.__fib_Value <= self.__maxValue):
if((self.__fib_Value % 2) == 0):
self.__answer += self.__fib_Value
else:
break
return self.__answer
class Fibonacci(tk.Frame):
compile = fib.Compile()
def __init__(self, master):
tk.Frame.__init__(self, master)
#label
tk.Label(self, text='Fibonacci retracement',
font='Helvetica 18 bold').grid(row=0, column=0)
#enter stock code label
tk.Label(self, text="Enter stock code",
font='TkDefaultFont 14').grid(row=2, column=0, sticky=tk.E)
stock_code = tk.Entry(self)
stock_code.grid(row=2, column=1)
#enter end date label
tk.Label(self, text="Enter end date",
font='TkDefaultFont 14').grid(row=3, column=0, sticky=tk.E)
end_date = tk.Entry(self)
end_date.grid(row=3, column=1)
#label
tk.Label(
self,
text=
"The start date is calculated by subtracting 6 months from \n the end date"
).grid(row=4, column=0)
def compile_fib():
fib.stock_code = stock_code.get()
fib.end_date = end_date.get()
self.compile.compile_fibonacci()
# show graph
show_graph = tk.Button(self,
text="Graph data",
command=lambda: compile_fib())
show_graph.grid(row=4, column=1)
#button to go back to home screen
tk.Button(self,
text="Home",
command=lambda: master.switch_frame(StartPage)).grid(
row=5, column=1)
ak = int(input("最小值："))
bk = int(input("最大值："))
L = [1e-2, 1e-3, 1e-4, 1e-5, 1e-6, 1e-7, 1e-8]
B = []
B_Value = []
G = []
G_Value = []
F = []
F_Value = []
for i in L:
b_value, b = Binary.BinarySearch(ak, bk, i)
g_value, g = Golden.GoldenSearch(ak, bk, i)
f_value, f = Fibonacci.FibonacciSearch(ak, bk, i)
B.append(b)
B_Value.append(b_value)
G.append(g)
G_Value.append(g_value)
F.append(f)
F_Value.append(f_value)
plt.figure(figsize=(12, 8), dpi=80)
plt.figure(1)
ax1 = plt.subplot(321)
plt.plot(L, B, "or") #color='#FF0000'
ax2 = plt.subplot(322)
plt.plot(L, B_Value, "oy")
ax3 = plt.subplot(323)
import Fibonacci Fibonacci.fib(1000) print(Fibonacci.fib2(100))
# -*- coding: utf-8 -*- """ Created on Wed Mar 17 15:27:15 2021 @author: yaser """ import Fibonacci x = Fibonacci.feb(10000) print(x)
def test_type_error_when_string_entered(self):
with self.assertRaises(TypeError):
Fibonacci.fib("shit")
def test_13(self):
if Fibonacci.fibonacciChecker(13)==True:
FibonacciTest.f.write("1,,5\n")
else:
FibonacciTest.f.write("0,Unsuccessful Fibonacci false positive detection,5\n")
self.assertEqual(Fibonacci.fibonacciChecker(13),True)
### Jump Search
start = time.time()
# # Algorithem starts here
x = Jump.Search(dic , search)
print("Jump Search Result: " + str(x))
# # Algoritem stops here
end = time.time()
print("Jump Search Time: " + str(end-start))
print()
##################################
### Fibonacci Search
start = time.time()
# # Algorithem starts here
x = Fibonacci.Search(dic , search)
print("Fibonacci Search Result: " + str(x))
# # Algoritem stops here
end = time.time()
print("Fibonacci Search Time: " + str(end-start) )
print()
##################################
### Exponential Search
start = time.time()
# # Algorithem starts here
x = Exponential.Search(dic , search)
print("Exponential Search Result: " + str(x))
# # Algoritem stops here
end = time.time()
print("Exponential Search Time: " + str(end-start))
import math
import Brent
import dichotomy
import function
import GoldenRation
import Fibonacci
import Parabol
import array
import numpy
import matplotlib.pyplot as plt
import scipy as scipy
epsilon = 0.1
a = 6
b = 10
# print('Дихтомия')
# dichotomy.dichotomy(epsilon, a, b)
# print('Золотое сечение')
# GoldenRation.goldenRatio(epsilon, a, b)
print('Фибоначи')
Fibonacci.Fibonacci(epsilon, a, b)
# print('метод Парабол')
# print(Parabol.parabola(a, 7, b, epsilon))
# print('Брент')
# print(Brent.Brent(epsilon, a, b))
'''
Created on Jul 17, 2016
@author: Greg Gagne
This simple script tests the fibonacci sequence implementation.
'''
import Fibonacci
import sys
'''
This behaves just like the Java main() method
'''
if __name__ == '__main__':
if (len(sys.argv) != 2):
print('Usage python RunFib.py [length of sequence]')
quit()
else:
print(Fibonacci.fibonacci(int(sys.argv[1])))
def test_21(self):
if Fibonacci.fibonacciChecker(21)==True:
FibonacciTest.f.write("1,,7\n")
else:
FibonacciTest.f.write("0,Large Fibonacci failue,7\n")
self.assertEqual(Fibonacci.fibonacciChecker(21),True)
def test_15(self):
if Fibonacci.fibonacciChecker(15)==False:
FibonacciTest.f.write("1,,6\n")
else:
FibonacciTest.f.write("0,Large Fibonacci failue,6\n")
self.assertEqual(Fibonacci.fibonacciChecker(15),False)
import Fibonacci
import Check
# Driver Code
print("Program to print Fibonacci series upto 'n'th term.")
input = input("Enter value for 'n' : ")
if (Check.IsNumber(input)):
print("Printing fibonacci series upto '" + input + "' terms.")
Fibonacci.Print(int(input))
else:
print("Entered value is not a valid integer. Please Retry.")
def crearFibonacci(cantidad):
i = 0
while i < cantidad:
radio = Fibonacci.fibonacci(i)
segmento(radio, 4)
i += 1
def fibonacci_test():
fib = Fibonacci()
# ITERATIF 35
begin = time.time()
fib.iteratif_lineair(35)
end = time.time()
print("Temps iteratif pour 35 éléments: %d s" % (end - begin))
# RECURSIF 35
begin = time.time()
fib.recursif(35)
end = time.time()
print("Temps récursif pour 35 éléments: %d s" % (end - begin))
# SUPER_ITERATIF 35
begin = time.time()
fib.iteratif_super(35)
end = time.time()
print("Temps itératif super linéaire pour 35 éléments: %d s" %
(end - begin))
# ITERATIF 100000
begin = time.time()
fib.iteratif_lineair(100000)
end = time.time()
print("Temps iteratif pour 100000 éléments: %d s" % (end - begin))
# SUPER_ITERATIF 100000
begin = time.time()
fib.iteratif_super(100000)
end = time.time()
print("Temps itératif superlinéaire pour 100000 éléments: %d s" %
(end - begin))
def test_negative_integer(self):
self.assertEqual(Fibonacci.fib(-1), 1)
def setUp(self):
self.fib = Fibonacci(1,2).generate()
self.fib_number = [1,2,3,5,8,13,21,34,55,89]
def test_one_entered(self):
self.assertEqual(Fibonacci.fib(1), 1)
n_selection = input("Please input the value of n: ")
if (int(n_selection) > 20):
print("Error: Please input a value less than or equal to 20")
else:
veracity = True
veracity = False
while (not veracity):
if (int(user_selection) == 1):
print(Power.powerOfTwo(int(n_selection)))
veracity = True
elif (int(user_selection) == 2):
veracity = True
print(Factorial.factorial(int(n_selection)))
elif (int(user_selection) == 3):
print(Fibonacci.Fibonacci(int(n_selection)))
veracity = True
else:
print("Invalid input please try again.\n")
do_repeat = input("Would you like to try again(y/n)? ")
if (do_repeat == "yes" or do_repeat == "y" or do_repeat == "Y"
or do_repeat == "Yes"):
repeat = True
else:
repeat = False
def test_9(self):
if Fibonacci.fibonacciChecker(9)==True:
FibonacciTest.f.write("1,,4\n")
else:
FibonacciTest.f.write("0,Unsuccessful normal Fibonacci generation,4\n")
self.assertEqual(Fibonacci.fibonacciChecker(9),True)
def test_zero_entered(self):
self.assertEqual(Fibonacci.fib(0), 0)
def crearFibonacci (cantidad):
i = 0
while i < cantidad:
radio = Fibonacci.fibonacci(i)
segmento (radio, 4)
i += 1
def test_expected_fibonacci_nr(self):
self.assertEqual(Fibonacci.fib(11), 89)
self.assertEqual(Fibonacci.fib(20), 6765)
def test_fib(self):
self.assertEqual(Fibonacci.fib(10), [1,1,2,3,5,8])
def test_type_error_when_none_entered(self):
with self.assertRaises(TypeError):
Fibonacci.fib(None)
def test_15(self):
if Fibonacci.fibonacciChecker(15) == False:
FibonacciTest.f.write("1,,6\n")
else:
FibonacciTest.f.write("0,Large Fibonacci failue,6\n")
self.assertEqual(Fibonacci.fibonacciChecker(15), False)
# Standard import: Definitions are in module's symbol table
import Fibonacci
print(Fibonacci.__name__)
Fibonacci.fib_print(50)
fib = Fibonacci.fib_list(50)
print("01: ", fib)
fl = Fibonacci.fib_list
print("02: ", fl(50))
# Import module definitions into global symbol table
from Fibonacci import fib_print, fib_list
print("03: ", fib_list(50))
# Rename on import
from Fibonacci import fib_list as my_fib_list
print("04: ", my_fib_list(50))
# Alternative: import Fibonacci as fib
print()
print("Module names:")
print(dir(Fibonacci))
print()
print("All names:")
print(dir())
# Next: https://docs.python.org/3.6/tutorial/modules.html#packages
# -*- coding: utf-8 -*- """ Created on Mon Jan 20 19:48:55 2020 @author: DELL """ import Fibonacci Fibonacci.fib(1000)
Python 3.7.0 (v3.7.0:1bf9cc5093, Jun 27 2018, 04:06:47) [MSC v.1914 32 bit (Intel)] on win32
Type "copyright", "credits" or "license()" for more information.
>>> python Fibonacci.py
SyntaxError: invalid syntax
>>> python
Traceback (most recent call last):
File "<pyshell#1>", line 1, in <module>
python
NameError: name 'python' is not defined
>>> Fibonacci.py
Traceback (most recent call last):
File "<pyshell#2>", line 1, in <module>
Fibonacci.py
NameError: name 'Fibonacci' is not defined
>>> Fibonacci.py 50
SyntaxError: invalid syntax
>>> import Fibonacci
>>> Fibonacci.fibonacci(30)
[0, 1, 1, 2, 3, 5, 8, 13, 21]
>>> Fibonacci 40
SyntaxError: invalid syntax
>>>
============== RESTART: G:\Softwares\Python 3.7.0\Fibonacci.py ==============
Traceback (most recent call last):
File "G:\Softwares\Python 3.7.0\Fibonacci.py", line 30, in <module>
fibonacci(int(sys.argv[1]))
IndexError: list index out of range
>>>
def test_fib_seq(self):
#Looping through some relatively low numbers to test sequential factorial
inputs = [3,8,4,10,-1,20,21]
results = [2,21,3,55,"FAILED inappropriate input value",6765,10946]
for x, curr_inp in enumerate(inputs):
self.assertEqual(Fibonacci.fib_seq(inputs[x]),results[x])
def test_21(self):
if Fibonacci.fibonacciChecker(21) == True:
FibonacciTest.f.write("1,,7\n")
else:
FibonacciTest.f.write("0,Large Fibonacci failue,7\n")
self.assertEqual(Fibonacci.fibonacciChecker(21), True)
def EvenFibonacciNumbers(UpTo=4000000):
return sum([i for i in Fibonacci(1, 2, UpTo) if i % 2 == 0])
