def test_recursive_fibonacci_number_border_values(self):
self.assertEqual(1, find_fibonacci_number_recursive(0))
self.assertEqual(1, find_fibonacci_number_recursive(1))
self.assertEqual(2, find_fibonacci_number_recursive(2))
self.assertEqual(1, find_fibonacci_number_iterative(0))
self.assertEqual(1, find_fibonacci_number_iterative(1))
self.assertEqual(2, find_fibonacci_number_iterative(2))
self.assertEqual(1, find_fibonacci_number_golden_ratio(0))
self.assertEqual(1, find_fibonacci_number_golden_ratio(1))
self.assertEqual(2, find_fibonacci_number_golden_ratio(2))
def test_recursive_fibonacci_number(self):
start_time = time.time()
result = find_fibonacci_number_recursive(40)
result_time = time.time() - start_time
print(
"\nTiming for finding 40th fibonacci sequence number with recursive method is {} s"
.format(result_time))
expected_result = 165580141
self.assertEqual(expected_result, result)
def test_wrong_type_inputs(self):
with self.assertRaises(TypeError):
find_fibonacci_number_recursive(complex(-1.0, 0.0))
find_fibonacci_number_iterative("33")
find_fibonacci_number_golden_ratio("111")
def test_negative_inputs(self):
with self.assertRaises(ValueError):
find_fibonacci_number_recursive(-1)
find_fibonacci_number_iterative(-2)
find_fibonacci_number_golden_ratio(-3)
def test_recursive_fibonacci_number_max_recursion_depth_exceeded(self):
with self.assertRaises(RecursionError):
find_fibonacci_number_recursive(5000)