mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
9b945cb2b4
* iterative and formula fibonacci methods Added two ways to calculate the fibonacci sequence: (1) iterative (2) formula. I've also added a timer decorator so someone can see the difference in computation time between these two methods. Added two unittests using the slash framework. * Update test_fibonacci.py * remove inline comments per Contributing Guidelines * Update sol5.py * Create placeholder.py * Update and rename maths/test_fibonacci.py to maths/tests/test_fibonacci.py * Delete placeholder.py * Create __init__.py * Update test_fibonacci.py * Rename Maths/lucasSeries.py to maths/lucasSeries.py * Update and rename Project Euler/Problem 01/sol5.py to project_euler/problem_01/sol6.py |
||
---|---|---|
.. | ||
tests | ||
3n+1.py | ||
abs_Max.py | ||
abs_Min.py | ||
abs.py | ||
average.py | ||
basic_maths.py | ||
Binary_Exponentiation.py | ||
extended_euclidean_algorithm.py | ||
factorial_python.py | ||
factorial_recursive.py | ||
fermat_little_theorem.py | ||
fibonacci_sequence_recursion.py | ||
fibonacci.py | ||
find_lcm.py | ||
Find_Max.py | ||
Find_Min.py | ||
greater_common_divisor.py | ||
Hanoi.py | ||
lucasSeries.py | ||
modular_exponential.py | ||
newton_raphson.py | ||
Prime_Check.py | ||
segmented_sieve.py | ||
sieve_of_eratosthenes.py | ||
simpson_rule.py | ||
trapezoidal_rule.py |