Servicios Personalizados
Revista
Articulo
Indicadores
Citado por SciELO
Accesos
Links relacionados
Citado por Google
Similares en SciELO
Similares en Google
Compartir
Tecnura
versión impresa ISSN 0123-921X
Resumen
MONTENEGRO SALCEDO, Luis Emilio y 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.
Palabras clave : Algorithms; algorithmic complexity; Analysis of Algorithms; computational efficiency; operations number; recurrences; recursion.