def test_fibonacci():
results = fibonacci.fib(100)
print(results)
fibonacci.fib2(100)
print("fibonacci.FIB_MAX = {0}".format(fibonacci.FIB_MAX))
print("fibonacci.__name__ = {0}".format(fibonacci.__name__))
help(fibonacci)
def testFib2():
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
for i in range(0, 10):
if (a[i] != fib2(i)):
print('Error in function fib2 at index {i}')
return
print('fib2 passed test from 0 to 10')
def test_fib1():
fun = fib2(1000)
lst2 = []
while True:
n = fun()
if n != None:
lst2.append(n)
else:
break
assert lst2 == list(fib(1000))
from fibonacci import fib, fib2 import fibonacci as fiblib fib2(1000) fiblib.fib(1000) # import the 'parent_package/sub_package/foo.py' import parent_package.sub_package.foo parent_package.sub_package.foo.sudo_func() from parent_package.sub_package.foo import sudo_func sudo_func() from parent_package.sub_package.bar import bar_func bar_func()
import fibonacci f = fibonacci.fib f(200) fibonacci.fib(10000) ------------- from fibonacci import fib, fib2 f = fib2(500) print(f) ------------- from fibonacci import * fib(500) print(fib2(500)) ------------ import fibonacci as fi fi.fib(500) ---------- from fibonacci import fib as fibonacci fibonacci(500)
import fibonacci print(fibonacci.fib2(15))
def wibble():
return f.fib2(n)
return
print('fib1 passed test from 0 to 10')
#test for function 2 polynomial algorithm
def testFib2():
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
for i in range(0, 10):
if (a[i] != fib2(i)):
print('Error in function fib2 at index {i}')
return
print('fib2 passed test from 0 to 10')
#test that the functions are working properly
testFib1()
testFib2()
#each functions gives the requested fibonacci number and records the time it takes
n = int(input('Enter an integer for n: '))
start_time = time.time()
answer = fib1(n)
end_time = time.time() - start_time
print("fib1 answer: {} with time: {} seconds ---".format(answer, end_time))
start_time = time.time()
answer = fib2(n)
end_time = time.time() - start_time
print("fib2 answer: {} with time: {} seconds ---".format(answer, end_time))
def test_fibonacci2():
# The quicker function
for i, fib_i in answers:
assert f.fib2(i) == fib_i
import fibonacci f = fibonacci.fib2 print(f(200)) f(200) fibonacci.fib(10000) ----------------- from fibonacci import fib, fib2 fib(500) print(fib2(500)) ---------------- from fibonacci import * fib(800) print(fib2(800)) --------------- import fibonacci as fi fi.fib(1000) ---------------
Purpose: Create a graph of the runtimes of each algorithm
"""
from fibonacci import fib1
from fibonacci import fib2
import matplotlib.pyplot as plt
import numpy as np
import time
plt.xlabel('n')
plt.ylabel('Time')
plt.title('Running time of two fibonacci algorithms')
x = [0,1,5,10,15,20,25,30,35]
#values taken from plugging in x values into fibonacciTest and multiplying by 10^5
expY = [0]
polyY = [0]
for i in range(0,8):
start_time = time.time()
fib1(x[i])
expY.append(time.time() - start_time)
start_time = time.time()
fib2(x[i])
polyY.append(time.time() - start_time)
plt.plot(x, expY, label = "Exponential(fib1)")
plt.plot(x, polyY, label = "Polynomial(fib2)")
plt.legend()
plt.show()
#fib.py import fibonacci # f = fibonacci.fib2 # print(f(200)) #fibonacci.fib(300) # --------------------- from fibonacci import fib, fib2 f = fib2(500) print(f) # ---------------------- # from fibonacci import * # fib(500) # print(fib2(500)) # -------------------- # import fibonacci as fi # fi.fib(500) # --------------------
def test_fib2(self):
self.assertEqual(fib2(1), 1)
#!/usr/bin/env python import fibonacci, sys print fibonacci.fib2(100) # If we will be using it frequently fib = fibonacci.fib2 print fib(100) # module's myvar will not clobber ours... myvar = 0 print myvar # ...unless explicit like this print fibonacci.myvar # or this from fibonacci import myvar print myvar print dir(fibonacci)
from fibonacci import fib, fib2
print("Este es un programa para calcular la serie fibonacci")
fib2(1000)
print("Este es un cambio de Claudia")
import fibonacci,algo
# import algo
# how to see variable & function in module use
print(dir(fibonacci))
print(20*"-")
print(dir(algo))
print('\n')
fibonacci.fib(200)
print(fibonacci.fib2(1000))
alphabets = ['B','E','C','D','A','F']
print(alphabets)
algo.buble(alphabets)
print(alphabets)
def testa_fib2(self):
sequencia = fib2(100)
self.assertEqual(sequencia, [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89])
import fibonacci
if __name__ == '__main__':
# in each module, the module name is stored under __name__
print 'module name:', fibonacci.__name__
print 'module func invoke 1:', fibonacci.fib(1000)
print 'module func invoke 2:', fibonacci.fib2(100)
# assign imported functions to local names
fib = fibonacci.fib2
print 'module func invoke 3:', fib(500)
# access global variables from other modules
print 'module global access:', fibonacci.fibglob
# import specific methods from a module
from multiply import square
print 'module func invoke 4:', square(5)
# import all names with wildcard (generally discouraged, less readable code)
# NOTE: this will import all names except those beginning with an underscore
# use reload() for new interpreter sessions to import modules/functions again
# if __name__ == '__main__' allows modules to be run as scripts
# work with command line arguments:
# import sys
# sys.argv[1]
# MODULE SEARCH PATH
# import 'spam'
# interpreter searches for built in module 'spam' first
def testa_fib2_entrada_invalida(self):
sequencia = fib2(-1)
self.assertEqual(sequencia, [])
from fibonacci import fib, fib2
print("este es un programa para clacular al serie fibonacci")
fib(1)
fib2(2)
