Study of Recursive and Iterative Approach on Factorial and Fibonacci Algorithm

Shah, Vatsal; Donga, Jayna

doi:10.21090/ijaerd.0101003

Cited by 1 publication

(3 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After implementation of factorial using both approaches for input size starting from 10 to 100000 [4], is shown below: As found in [4], the poor performance for the recursive approach compared to an iterative approach is that, recursive algorithm contains heavy push-pop of the registers in the worst level of each function call.…”

Section: Recursive Factorial (Int Num)mentioning

confidence: 99%

“…The iterative algorithm for Fibonacci series is considerably faster since it doesn"t involve calculating the redundant things [4].…”

Section: Related Workmentioning

confidence: 99%

“…Let us take an algorithm, Factorial, which is written to find the factorial of a given number. As analyzed in [4], the iterative approach of Factorial is written as:…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Performance Anatomization of Computer Algorithms Based on Iterative and Recursive Methodologies

Nair*

2020

IJRTE

View full text Add to dashboard Cite

An algorithm is a clear specification of a sequence of instructions which when followed, provides a solution to a given problem. Writing an algorithm, depends upon various parameters, which leads to strong algorithmic performance, in terms of its computational efficiency and solution quality. This research paper presents the different methodologies of writing algorithms of data structure and also provides their performance analysis with respect to time complexity and space complexity. As we know that, for the same problem, we will have different algorithms, written using different approaches. All approaches of algorithms are important and have been an area of focus for a long time but still the question remains the same "which to use when?", which is the main reason to perform this research. This research provides a detailed study of how algorithms being written using different approaches work and then compares them on the basis of various parameters such as time complexity and space complexity, to reach the conclusion.

show abstract

Section: Recursive Factorial (Int Num)mentioning

confidence: 99%

“…The iterative algorithm for Fibonacci series is considerably faster since it doesn"t involve calculating the redundant things [4].…”

Section: Related Workmentioning

confidence: 99%