[Home] [Puzzles & Projects] [Delphi Techniques] [Math Topics] [Library] [Utilities]
Recursion is a programming technique that can accomplish a lot with a little bit of code. Because recursive procedures call themselves, their operation seems like magic. Here are a couple of recursive functions - one to calculate factorials and one to calculate Fibonacci numbers.
Here is a program that calculates integer powers of a real number. Recursion is one of 4 techniques tested. The program will also introduce you to techniques for accurately measuring program run times. Click here to download source code for IntPowerDemo.
Copyright © 2000-2013, Gary Darby
All rights reserved.