what are the advantage and disadvantage of recursion
- 5 Answers
- 50574 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / vadivelt
Recursion will be useful when same kind of job has to be
continued for a finite no input or time.
Eg: calculating series, finding factorial etc..
Disadvantage would be,
1.Hard to analyse or understand the code.
2.If the recursive function is called for infinite no of
times and memory constrains are not taken care, then stack
overflow may occur So system may crash.
| Is This Answer Correct ? | 52 Yes | 7 No |
Answer / vasu jain
Recursion
Advantage
i. Usually simplicity.
ii. Although at most of the times a problem can be solved without recursion, but in some situations in programming, it is a must to use recursion. For example, a program to display a list of all files of the system cannot be solved without recursion.
iii. The recursion is very flexible in data structure like stacks, queues, linked list and quick sort.
iv. Using recursion, the length of the program can be reduced.
Disadvantage
i. It requires extra storage space. The recursive calls and automatic variables are stored on the stack. For every recursive calls separate memory is allocated to automatic variables with the same name.
ii. Often the algorithm may require large amounts of memory if the depth of the recursion is very large. If the programmer forgets to specify the exit condition in the recursive function, the program will execute out of memory.
iii. The recursion function is not efficient in execution speed and time.
iv. Some function calls inside recursion are repeated or duplicated just like fibonacci
| Is This Answer Correct ? | 47 Yes | 5 No |
Answer / suman boddukuru
Advantage : Perform an action untill a condition
satisfies,Also for the repetative calls for inputting and
etc.
Disadvantage: If it encounters the infinite looping then
the stack overflow occurs it will cause ssem crash...
| Is This Answer Correct ? | 32 Yes | 8 No |
Answer / satyabrata nayak
Recursion will be useful when same kind of job has to be
continued for a finite no input or time.
Eg: calculating series, finding factorial etc..
Disadvantage would be,
1.Hard to analyse or understand the code.
2.If the recursive function is called for infinite no of
times and memory constrains are not taken care, then stack
overflow may occur So system may crash.
| Is This Answer Correct ? | 23 Yes | 6 No |
Answer / jyoti singh
Advantages of recursion:-
1.Recursion is more efficient if the program using recursion is run on computer with multiprocessing facilities.
2.It is very useful in solving the data structure problems.
3. It is easily, simple and understandable.
Disadvantages of recursion:-
1. It requires more memory because recursive calls along with automatic variables are stored on the stack.
2.The computer may run out of memory if recursive calls are not properly checked.
| Is This Answer Correct ? | 15 Yes | 0 No |
Create a registration form application by taking the details like username, address, phone number, email with password and confirm password (should be same as password).Ensure that the password is of 8 characters with only numbers and alphabets. Take such details for 3 users and display the details. While taking input password must appear as “****”.
C program execution always begins with a) #include b) comment (/*-------*/) c) main() d) declaration instructions
What are the types of arrays in c?
please explain clearly about execution of c program in detail,in which stage are the printf sacnf getting into exeecutable code
What is structure data type in c?
What is the difference between near, far and huge pointers?
For what purpose null pointer used?
Wt are the Buses in C Language
hello friends what do u mean by BUS ERROR i got this error while i am doing my program in DATA STRUCTURES
What is a good way to implement complex numbers in c?
void main() { char c; while(c=getchar()!='\n') printf("%d",c); } o/p=11 why?
What is the output of following program ? int main() { int x = 5; printf("%d %d %d\n", x, x << 2, x >> 2); }
C 
