There are two approaches to writing repetitive algorithms. <\/p>\n
1. Loops (Iteration)<\/span> There are two approaches to writing repetitive algorithms. 1. Loops (Iteration) 2. Recursion. Iteration: Use for loops, do..while, while loops.Example: … Continue reading
2. Recursion. <\/span>
Iteration: <\/strong>Use for loops, do..while, while loops.<\/span>
Example: <\/strong>Factorial of a number<\/span>
int factorial(int num)
{
int k=num;
while(num != 0)
{
k=k*(num-1);
num–;
}
return num;
}
<\/span>—————————————————————————————————–<\/span>
Recursion: <\/strong>Recursion is a repetitive process in which a function calls itself. <\/span>
Limitations of Recursive Approach:
<\/strong> 1. Recursive solutions may involve extensive overhead because they use function calls. Each function call requires push of return memory address, parameters, returned result,etc. and every function return requires that many pops. <\/span>
2. Each time you call a function you use up some of your memory allocation may be in stack or heap. If there are large number of recursive calls – then you may run out of memory. <\/span>
Example:
<\/strong>int factorial(int num)
{
if(num != 0)
{
num=num*factorial(num-1);
}
return num;
}
<\/span>When to Use:
<\/strong>For large number of iterations, use loops(iterative approach).
For small number of iterations, use recursion.<\/span><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"