def test_fibonacci(self): self.assertEqual(main.fibonacci(91), 4660046610375530309) self.assertEqual(main.fibonacci(31), 1346269) self.assertEqual(main.fibonacci(0), 0) self.assertEqual(main.fibonacci(1), 1) self.assertEqual(main.fibonacci(199), 173402521172797813159685037284371942044301) self.assertEqual(main.fibonacci(310), 27332759203762391000908267962175339332906872716290689783750745455)
def test_fibpositive(self):
response = fibonacci(5)
self.assertEqual(response.status_code, 200)
def test_answer(self):
assert fibonacci(8) == 13
assert fibonacci(12) == 89
assert fibonacci(15) == 377
assert fibonacci(1) == 1
assert fibonacci(2) == 1
def test_returns_correct_fibonacci_number(self):
correct_sequence = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144]
for index in range(len(correct_sequence)):
response = fibonacci(index)
assert response == correct_sequence[index]
def test_raise_value_error_on_negative_input(self):
with pytest.raises(ValueError):
fibonacci(-1)
def test_fibonacci(self):
self.assertIsNotNone(main.fibonacci)
fibs = (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89)
for n in range(11):
self.assertEqual(main.fibonacci(n), fibs[n])
def test_1():
assert fibonacci(1) == 1
def test_0():
assert fibonacci(0) == 0
def test_5():
assert fibonacci(5) == 5
def test_6():
assert fibonacci(6) == 8
def test_4():
assert fibonacci(4) == 3
def test_3():
assert fibonacci(3) == 2
def test_2():
assert fibonacci(2) == 1
def test_fibnegative(self):
response = fibonacci(-5)
self.assertEqual(response, "Please enter a positive integer")
def test_7():
assert fibonacci(7) == 13
def test_something(self):
self.assertEqual(fibonacci(10), 55)
def test_compound_algorithem(self): self.assertEqual(main.my_sequence(main.factorial(4)), 7695) # 24th my sequence number self.assertEqual(main.fibonacci(main.factorial(5)), 5358359254990966640871840) # the 120th fibinaci number self.assertEqual(main.fibonacci(main.my_sequence(16)), 3210056809456107725247980776292056) # 162th fibinaci number
