Time Complexity Reduction and Ciode Optimization Built on the Base of Algebraic Equation using Progression

Bai, Vidya G and Nethravathi, P. S and K.E, Prskash (2020) Time Complexity Reduction and Ciode Optimization Built on the Base of Algebraic Equation using Progression. Journal of Advanced Research in Dynamical and Control Systems. pp. 1-5. ISSN 1943023X

[img] PDF
DisplayPdf 3.pdf

Download (321kB)

Abstract

Abstract--- As the time goes the complexity in hardware and software increases. This increase in hardware and the software space and time reduces the efficiency of the system in which it is used. There are several methods to optimize these two components. In this work it has been processed in the area of software. Basically the program optimization is done using the for loop structure. The for loop structure will have a control components, these components are used for the purpose of generating an equation. This equation is based on the progression. The components of the for loop is substituted in the arithmetic and geometric progression equation to reduce the timing of the for loop. The result shows that, a drastic change in the time complexity from to for a simple example. This can be further for all loops. Keywords-- Code Optimization, Time Complexity, Loops, Optimization, Convergence.

Item Type: Article
Uncontrolled Keywords: code optimization, time complexity, loops, optimization, convergence
Subjects: Departments at MU > Commerce
Depositing User: department of Commerce
Date Deposited: 01 Jan 2021 04:52
Last Modified: 01 Jan 2021 04:52
URI: http://eprints.manipal.edu/id/eprint/156184

Actions (login required)

View Item View Item