Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Journal of Information Technology and Computer Science
Efi Riyandani
Brawijaya University
Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Review: A State-of-the-Art of Time Complexity (Non-Recursive and Recursive Fibonacci Algorithm) Imam Cholissodin; Efi Riyandani
Journal of Information Technology and Computer Science Vol. 1 No. 1: June 2016
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1010.148 KB) | DOI: 10.25126/jitecs.2016112

Abstract

Abstract. Solving strategies in the computation the time complexity of an algorithm is very essentials. Some existing methods have inoptimal in the explanations of solutions, because it takes a long step and for the final result is not exact, or only limited utilize in solving by the approach. Actually there have been several studies that develop the final model equation Fibonacci time complexity of recursive algorithms, but the steps are still needed a complex operation. In this research has been done several major studies related to recursive algorithms Fibonacci analysis, which involves the general formula series, begin with determining the next term directly with the equation and find the sum of series also with an equation too. The method used in this study utilizing decomposition technique with backward substitution based on a single side outlining. The final results show of the single side outlining was found that this technique is able to produce exact solutions, efficient, easy to operate and more understand steps. Keywords: Time Complexity, Non-Recursive, Recursive, Fibonacci Algorithm
Co-Authors Imam Cholissodin