Andiyani, Ventryshia and Istiono, Wirawan (2020) Analysis of Fibonacci Numbers Calculations Using Static Programming and Dynamic Programming Algorithms to Get Optimal Time Efficiency. International Journal of Open Information Technologies, 8 (12). ISSN 2307-8162
Full text not available from this repository.Abstract
Fibonacci numbers are simple numbers that are the sum of two consecutive numbers. There are many methods and many way to get Fibonacci result to solve many problems in real life or programming problem, in this research will determine the optimal time efficiency to solve the problem of calculating Fibonacci numbers, either by using static programming algorithm, such as recursive algorithm or with the dynamic programming algorithm, such as top-down approach algorithm and the bottom-up approach algorithm method. The problem-solving strategy is performed by calculating the execution time required by the three algorithms to get accurate results using C language with many various counts of inputs. From the comparison of Fibonacci search methods, it was found that by using the Dynamic programming method with a bottom-up approach the algorithm has a more optimal efficiency than the top-down approach from dynamic programming or from static programming with a recursive algorithm
| Item Type: | Article |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 006 Special Computer Methods |
| Divisions: | Faculty of Engineering & Informatics > Informatics |
| Depositing User: | Administrator UMN Library |
| Date Deposited: | 15 Oct 2021 04:48 |
| Last Modified: | 15 Oct 2021 04:48 |
| URI: | https://kc.umn.ac.id/id/eprint/18806 |
Actions (login required)
 |
View Item |
