Menu
With respect to using recursion over non-recursive methods in sorting algorithms or, for that matter, any algorithm what are its pros and cons?
462
Recursion adds clarity and (sometimes) reduces the time needed to write and debug code (but doesn't necessarily reduce space requirements or speed of execution). Reduces time complexity. Performs better in solving problems based on tree structures.
In short and simple terms, a recursive function is one which calls itself. Advantage: It can reduce time complexity and has a relaxation on the number of iterations( we can run a variable number of loops ). It is easy to implement. Disadvantage: It can throw a StackOverflowException since it consumes a lot of memory.
Because the function has to add to the stack with each recursive call and keep the values there until the call is finished, the memory allocation is greater than that of an iterative function. Recursion can be slow. If not implemented correctly (as stated above with memoization) it can be much slower than iteration.
For the most part recursion is slower, and takes up more of the stack as well. The main advantage of recursion is that for problems like tree traversal it make the algorithm a little easier or more "elegant". Check out some of the comparisons:
link
157
Recursion means a function calls repeatedly
It uses system stack to accomplish its task. As stack uses LIFO approach and when a function is called the controlled is moved to where function is defined which has it is stored in memory with some address, this address is stored in stack
Secondly, it reduces a time complexity of a program.
Though bit off-topic,a bit related. Must read. : Recursion vs Iteration
37
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
