{'fraction_non_alphanumeric': 0.015600624024960999, 'fraction_numerical': 0.0046801872074883, 'mean_word_length': 5.829787234042553, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A study on Fibonacci series generation algorithms

many algorithms proposed to generate Fibonacci series introduced by a 12th century Italian mathematician Leonardo Bonacci [1]. The study paper gives insight into three different Fibonacci series generation algorithms. This paper compares and contrasts three different algorithms namely LINEAR_FIB, EXPO_FIB and MATRIX_FIB. Time complexities of these algorithms are computed. The results of our study show that the three algorithms gives linear, exponential and logarithmic time complexities. Finally we discussed application areas of Fibonacci numbers which are generated by the algorithms.