Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
Tecnura
Print version ISSN 0123-921X
Abstract
MONTENEGRO SALCEDO, Luis Emilio and ALVARADO NIETO, Luz Deicy. Technique for recurrences solving, used in recursive algorithm complexity analysis. Tecnura [online]. 2015, vol.19, n.spe, pp.89-97. ISSN 0123-921X. https://doi.org/10.14483/udistrital.jour.tecnura.2015.3.a07.
This paper shows an alternative, direct and unusual method to solve both first order recurrences homogeneous and inhomogeneous; applicable to equations representing the behavior of recursive algorithms. Such method is associated with the performance of the computational algorithm, by facilitating the understanding and complexity analysis. The process is illustrated by examples of equations for well-known and frequently used algorithms.
Keywords : Algorithms; algorithmic complexity; Analysis of Algorithms; computational efficiency; operations number; recurrences; recursion.