Performance Anatomization of Computer Algorithms Based on Iterative and Recursive Methodologies
Raji Ramakrishnan Nair

Ms. Raji Ramakrishnan Nair, Assistant Professor in P. G. Department of Computer Applications, Marian College Kuttikkanam (Autonomous), India.
Manuscript received on January 02, 2020. | Revised Manuscript received on January 15, 2020. | Manuscript published on January 30, 2020. | PP: 1272-1276 | Volume-8 Issue-5, January 2020. | Retrieval Number: E4584018520/2020©BEIESP | DOI: 10.35940/ijrte.E4584.018520

Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: 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.
Keywords: Algorithm, Performance Analysis, Time Complexity, Space Complexity, Iteration, Recursion.
Scope of the Article: High Performance Computing.