What are advantages and disadvantages of recursive
calling ?

Answers were Sorted based on User's Feedback

advantage:using recursion we can avoid unnecessary calling
of functions.
disadvantage:by too many recursive functions there may be
confusion in the code.

 Is This Answer Correct ? 133 Yes 53 No

Answer / sachin mahajan

Through Recursion one can Solve problems in easy way while
its iterative solution is very big and complex.
Ex : tower of Hanoi
You reduce size of the code when you use recursive call.

Recursive solution is always logical and it is very
difficult to trace.(debug and understand)

Before each recursive calls current values of the varibles
in the function is stored in the PCB, ie process control
block and this PCB is pushed in the OS Stack.
So sometimes alot of free memory is require for recursive
solutions.

Remember : whatever could be done through recursion could be
done through iterative way but reverse is not true.

 Is This Answer Correct ? 102 Yes 30 No

Recursion is used to divide the problem into same problem
of subtypes and hence replaces complex nesting code.

Recursion takes a lot of stack space, usually not
considerable when the program is small and running on a PC.

It is very hard to debug or extend the functionality in
case of recursive logic.

 Is This Answer Correct ? 66 Yes 8 No

advantage:using recursion we can avoid unnecessary callingof
functions.
disadvantage:recursive calling increase the space complexity.

 Is This Answer Correct ? 45 Yes 15 No

Use of recursion in an algorithm has both advantages and
disadvantages. The main advantage is usually simplicity.
The main disadvantage is often that the algorithm may
require large amounts of memory if the depth of the
recursion is very large. High memory consumption is due to
large function call number (recursion means that function
calls itself multiple times).

 Is This Answer Correct ? 26 Yes 5 No

Answer / ganesh narayanan

advantage : A recursive definition defines an object in simpler cases of itself reducing nested looping complexity

disadvantage : less efficient as compared to the non-recursive counterparts as the overhead involved in entering,re-entering and exiting a block is avoided in case of the non recursive forms. its also possible to identify a number of local variables which need not be saved and restored with the help of stacks and this unwanted stacking activity is avoided in the non-recursive versions.

 Is This Answer Correct ? 26 Yes 7 No

Why is recursion frowned upon??

User space programs: memory consumption
----------------------------------------
User stack is a dynamic stack i.e. we page fault on the
stack virtual addresses and resolve the fault by allocating
a physical page. Many recursions can lead to a lot of (user
stack) memory being consumed. In a traditional programming
model, when a thread blocks, then all the memory is stuck
with the thread, until the paging daemon kicks it out. So,
effectively, many threads doing recursive calls can consume
a lot of memory and force memory pressure to occur in the
system i.e. system slows down.

Kernel Space program: stack depth
---------------------------------
A kernel stack is fixed in size i.e. 8K or 16K usually. And
this stack does not grow dynamically in most OSes. So,
there is a bound on how much memory can be used for the
kernel stack, unlike user programs. But, this bound on the
stack size is the reason why recursion is discouraged. More
recursive levels can lead to a stack overflow and this will
panic the box. One might say: hey, my recursive depth is
only 10. But, what is unknown is what amount of kernel
stack is already used up && the stack frame consumption
depends on the chip architecture that is being used.

For both of the above reasons, recursion is avoided in
general kernel programming.

 Is This Answer Correct ? 20 Yes 12 No

Recursive procedures are huge memory hogs. Also, they're a
nightmare to debug. Finally, it's pretty rare to find an
application that actually needs recursion as opposed to a
simpler, more friendly methodolgy.

 Is This Answer Correct ? 6 Yes 1 No

1. It is requires extra storage space. The recursive calls and automatic variable a stored on the stack. For every calls separate memory is allocated to automatic variable with the same name.
2. the recursion function is not efficient in execution speed and time.
3. Some function called inside recursion are repeated or duplicated just like Fibonacci.

 Is This Answer Correct ? 2 Yes 0 No

recursive functions can be effectively used to solve
problems where the solution is expressed in terms of
applying the same solution.
in recursive we must have an if statement somewhere to
force the func. to return without the recursive call being
executed.otherwise the funct. will never return.

 Is This Answer Correct ? 22 Yes 35 No

More C Interview Questions

which is an algorithm for sorting in a growing Lexicographic order

how to do in place reversal of a linked list(singly or doubly)?

I have one doubt. What does below statement mean? #define sizeof(operator) where operator can be int or float etc. Does this statement meaningful and where it can be used?

main() { int i; printf("%d",i^i); }

#include<stdio.h> void main() { int a,b,c; a=b=c=1; c=++a || ++b && ++c; printf("%d\t%d\t%d",a,b,c); }

what is the purpose of the code, and is there any problem with the code? int f( int n, int l, int r ) { return (n << l) >> r; }

write a c programs to do multiplication of two numbers with out using arithmatic operator ??????????

Write a program that takes a 5 digit number and calculates 2 power that number and prints it.

Please provide question papers of NATIONAL INFORMATICS CENTRE for Scientific officer

write program on arrays

why programming language C is still used in operating system's kernel??

player is good if the following conditions are satisfied: He is either from “India”, “Japan” or “Korea” He has a minimum of 3 years of experience He has won at least 3 major tournaments, and one of them must be "World Championship Tournament". He must know more than 10 techniques. (but see next question) If he knows less than 10 techniques, then he must be a world champion. His name contains at least 3 words. For example "Sachin Tendulkar" will not meet this condition. Write a method: boolean isGoodPlayer(String name, String country, int yearsExperience, String[] majorTournamentsWon, String[] techniques, boolean isWorldChampion) name country yearsExperience majorTournamentsWon techniques isWorldChampion

Categories