Programming - which takes less time to execute.? ordinary functions or recursive functions .

GeekInterview.com

I am new, Sign me up!

GeekInterview.com > Placement Papers > Intel > Programming

Go To First | Previous Question | Next Question

Programming | Question 6 of 9

Print

which takes less time to execute.? ordinary functions or recursive functions .

Total Answers and Comments: 5

Last Update: August 06, 2007

Sponsored Links

Best Rated Answer

—

No best answer available. Please pick the good answer available or submit your answer.

September 12, 2005 18:51:14

#1

non-name

RE: which takes less time to execute.? ordinary functi...

Ordinary

Is this answer useful? Yes | No

January 10, 2006 06:11:57

#2

ashok

RE: which takes less time to execute.? ordinary functi...

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

Is this answer useful? Yes | No

January 24, 2006 12:33:50

#3

adhyas

RE: which takes less time to execute.? ordinary functi...

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

Is this answer useful? Yes | No

July 18, 2007 22:39:15

#4

Neo

RE: which takes less time to execute.? ordinary functi...

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

Is this answer useful? Yes | No

August 06, 2007 03:02:16

#5

mmh

RE: which takes less time to execute.? ordinary functi...

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.

Is this answer useful? Yes | No

Sponsored Links

Related Categories

—

Sponsored Links

About Us - Privacy Policy - Terms and Conditions - Contact - Ask Question - Propose Category - Site Updates

Copyright © 2005 - 2009 GeekInterview.com. All Rights Reserved