SciELO - Scientific Electronic Library Online

 
vol.19 special issueWEP, WPA and WPA2 encryption protocols vulnerability on wireless networks with Linux platformMonitoring system for high-risk patients integrating GPS, GSM/GPRS and Zigbee modules author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars 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.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License