English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

2006-06-17 22:33:52 · 3 answers · asked by lordvirgo31 2 in Computers & Internet Programming & Design

3 answers

Recursion Requirements are :
The Recursive equation : An=An-1 + An-2
The Terminating Conditions : Ao=0 , A1 = 1 ..

2006-06-17 22:46:55 · answer #1 · answered by jmdanial 4 · 0 0

You need a language that supports recursive functions. Because recursive functions run a copy of the function in every recursive loop, the process can suck up A LOT of memory. Since EVERY recursive function can be written in a for loop or while loop, recursive function exists mainly in theory and is not widely practised in the real world.

2006-06-19 02:16:27 · answer #2 · answered by knitting guy 6 · 0 0

Programming languages that can use recursion are languages that use dynamic memory allocation. In the past, very few language (eg. C, Modula 2) used dynamic memory; usually, you'd have to use assembly language.

Since about the mid-1990s, most programming languages (including some versions of BASIC, COBOL and Fortran) handled dynamic memory. You can use almost any compiler, but check your compiler's manual for recursion and "return" functions.

As for hardware, the only limitation on recursion is the amount of memory on the machine and the processor speed.

2006-06-18 02:37:23 · answer #3 · answered by Anonymous · 0 0

fedest.com, questions and answers