Issue No. 03 - May/June (2003 vol. 5)
Julian V. Noble , University of Virginia
<p>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.</p>
J. V. Noble, "Recurses!," in Computing in Science & Engineering, vol. 5, no. , pp. 76-81, 2003.