By Topic

Recurses!

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Noble, J.V. ; Dept. of Phys., Virginia Univ., Charlottesville, VA, USA

The author considers 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, it is seldom used. Correctly used, recursion is so valuable you should use it whenever it makes programs clearer or briefer. He explains when recursion is appropriate and when it is a bad idea, and also shows how you might find it useful.

Published in:

Computing in Science & Engineering  (Volume:5 ,  Issue: 3 )