File APIs for Java Developers
Manipulate DOC, XLS, PPT, PDF and many others from your application.
The moose likes Java in General and the fly likes Recursive Functions Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login

Win a copy of Java Interview Guide this week in the Jobs Discussion forum!
JavaRanch » Java Forums » Java » Java in General
Bookmark "Recursive Functions" Watch "Recursive Functions" New topic

Recursive Functions

Arivazhagan Arutchelvam

Joined: Feb 19, 2008
Posts: 10
Is it the right way to use recursive funtions?

If not what is the alternate?
Sven Meys

Joined: Feb 13, 2008
Posts: 7
On scenario's where it is usefull to use recusion it is mostly the best option.
Just make sure your code stays a bit readable.
Ulf Dittmer

Joined: Mar 22, 2005
Posts: 42965
There's nothing wrong with recursive algorithms per se. They tend to be shorter, and look more elegant when implemented, although that can be deceiving.

One example are the Fibonacci numbers. They are usually defined recursively, and very easy to implement that way. But the recursive approach has exponential complexity, while it's easy to implement an iterative approach that has linear complexity.

So the answer is, it depends. They're neither always faster, nor always slower, than comparable non-recursive algorithms. I'm mentioning this because I've seen both opinions stated numerous times, and they're simply not true.
[ February 20, 2008: Message edited by: Ulf Dittmer ]
Campbell Ritchie

Joined: Oct 13, 2005
Posts: 46412
The problem with recursion is that it can be hungry on memory; I find on my PC that recursions which get out of hand cause a StackOverflowError somewhere between 3000 and 4000 calls. But recursion done correctly is a nice technique, as Ulf has told us.

But I know how to write a Fibonacci recursion which runs in linear time, and if you look in Anne Kaldewaij's book Programming : the derivation of algorithms Hemel Hempstead : Prentice Hall International, 1990, I think page 98, you can find how to write a Fibonacci number which runs in logarithmic time.

The alternative to recursion is iteration, which in Java means while, do-while or for.
I agree. Here's the link:
subject: Recursive Functions
It's not a secret anymore!