b93a9d8e8faa115d06a6bd656f5bf0e91254c1de,maths/lucas_series.py,,,#,18

Before Change




if __name__ == "__main__":
    limit = int(input("How many terms to include in Lucas series:"))
    print("Lucas series:")
    for i in range(limit):
        print(recur_luc(i))

After Change



    testmod()
    n = int(input("Enter the number of terms in lucas series:\n").strip())
    n = int(input("Enter the number of terms in lucas series:\n").strip())
    print("Using recursive function to calculate lucas series:")
    print(" ".join(str(recursive_lucas_number(i)) for i in range(n)))
    print("\nUsing dynamic function to calculate lucas series:")
    print(" ".join(str(dynamic_lucas_number(i)) for i in range(n)))
Italian Trulli
In pattern: SUPERPATTERN

Frequency: 3

Non-data size: 10

Instances


Project Name: TheAlgorithms/Python
Commit Name: b93a9d8e8faa115d06a6bd656f5bf0e91254c1de
Time: 2020-10-25
Author: kushagrabansalajmer@gmail.com
File Name: maths/lucas_series.py
Class Name:
Method Name:


Project Name: TheAlgorithms/Python
Commit Name: c359768e257a7bcbfe93e137a0fc1e81b92d6573
Time: 2020-12-08
Author: 58473917+Joe-Sin7h@users.noreply.github.com
File Name: sorts/bitonic_sort.py
Class Name:
Method Name:


Project Name: TheAlgorithms/Python
Commit Name: 7dff214d9ba2bd178830d06422073022def49ba3
Time: 2016-07-29
Author: me@sergeytsaplin.com
File Name: BinarySeach.py
Class Name:
Method Name: