This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Recurses!
May/June 2003 (vol. 5 no. 3)
pp. 76-81
Julian V. Noble, University of Virginia

This column is about recursion: functions, subroutines, and even whole computer languages defined in terms of themselves. Recursion is a direct and elegant way to translate certain mathematical relations into programs, and it's a great technique for discovering efficient algorithms. Given its utility, you might wonder why people seldom use it.

Citation:
Julian V. Noble, "Recurses!," Computing in Science and Engineering, vol. 5, no. 3, pp. 76-81, May-June 2003, doi:10.1109/MCISE.2003.1196311
Usage of this product signifies your acceptance of the Terms of Use.