def test_memo_1(): assert fib.fib_memo(1) == 1
def test_memo_10(): assert fib.fib_memo(10) == 55
def test_memo_0(): assert fib.fib_memo(0) == 0
def test_with_20(self): num = 20 result = 6765 self.assertEqual(fib_memo(num), result)
def test_with_10(self): num = 10 result = 55 self.assertEqual(fib_memo(num), result)
def test_with_2(self): num = 2 result = 1 self.assertEqual(fib_memo(num), result)
def test_with_0(self): num = 0 result = 0 self.assertEqual(fib_memo(num), result)
#! /usr/bin/python3 """ file: problem2.py author: Nicholas Kachur <*****@*****.**> course: CS 260-003, hw3 date: 2014-07-09 Write memoized version fib_memo(n) of the recursive Fibonacci function as with an array of size 100 (i.e., you may assume you will never be asked for a number greater than fib_memo(100).) """ if __name__ == '__main__': import fib # Import all of fib so that memoizes/caches properly from sys import argv usage = 'Usage: {script_name} <n>\n\tReturns the nth Fibbonacci number' return_string = 'Fibbonacci_memo({n}) is: {result}' if len(argv) != 2: print(usage.format(script_name=argv[0])) else: n = int(argv[1]) print( return_string.format(n=n, result=fib.fib_memo(n)) )