non-name

• Sep 12th, 2005

 

Ordinary

ashok

• Jan 10th, 2006

 

Please dont answer wrongly......Recursive takes less time to execute.

adhyas

• Jan 24th, 2006

 

and y does recursive take less time ?? if possible respond at my email id: adhyas2@rediffmail.com

Neo

• Jul 18th, 2007

 

Iterative takes less time to execute. Recursive functions have the extra function-call overhead! ..

mmh

• Aug 6th, 2007

 

Note that the question asks which type of "function" takes less time to execute, not algorithm. While recursive algorithms generally take less time (depending on application), recursive functions have more overhead (a function call translates to several CPU instructions).

So, the answer is ordinary functions.