0
A recursive call in an algorithm is when a function (that implements this algorithm) calls itself.
For example, Quicksort is a popular algorithm that is recursive.
The recursive call is seen in the last line of the pseudocode, where the quicksort function calls itself.
function quicksort('array') create empty lists 'less' and 'greater' if length('array') ≤ 1 return 'array' // an array of zero or one elements is already sorted select and remove a pivot value 'pivot' from 'array' for each 'x' in 'array' if 'x' ≤ 'pivot' then append 'x' to 'less' else append 'x' to 'greater' return concatenate(quicksort('less'), 'pivot', quicksort('greater'))
Wiki User
∙ 12y ago
Wiki User
∙ 9y agoAn algorithm is a set of instructions that do some task. An algorithm can recursive or non recursive calls. A recursive call is when a function calls itself.
Add your answer:
Earn +20 pts
When you choose iterative or recursive algorithm?
If you cannot find any iterative algorithm for the problem, you have to settle for a recursive one.
What is recursive algorithm and write a recursive algorithm to reverse a string also trace it for any string data?
A recursive algorithm is an algorithm which calls itself with "smaller (or simpler)" input values, and which obtains the result for the current input by applying simple operations to the returned value for the smaller (or simpler) input. Heres a recursive algorithm to reverse a string char *rev(char str[],int pos1,int pos2) { if(pos1<pos2) { char temp=str[pos1]; str[pos1]=str[pos2]; str[pos2]=temp; return rev(str,pos1+1,pos2-1); } return str; } You can call this function like this char *r=rev("reverse it",0,9);
What causes a recursive algorithm to stop calling itself?
If the condition has been reached.
Explain non-recursive and recursive algorithm for postorder traversal on binary tree?
Step 1:- select first root node (t), start travelsing left contin
What is recursive algorithm?
Algorithm can be defined as an interpretable, finite set of instructions for dealing with contigencies and accompanying task that has recognizable end-points for given inputs. It is a tool for solving a well computational problem. A recursive algorithm is one which calls itself.
What is a base case?
A base case is the part of a recursive definition or algorithm which is not defined in terms of itself.
What is base case?
A base case is the part of a recursive definition or algorithm which is not defined in terms of itself.
When you choose iterative or recursive algorithm?
If you cannot find any iterative algorithm for the problem, you have to settle for a recursive one.
Recursive algorithm to check a no is prime or not?
Suck a dick until it works
What is recursive algorithm and write a recursive algorithm to reverse a string also trace it for any string data?
A recursive algorithm is an algorithm which calls itself with "smaller (or simpler)" input values, and which obtains the result for the current input by applying simple operations to the returned value for the smaller (or simpler) input. Heres a recursive algorithm to reverse a string char *rev(char str[],int pos1,int pos2) { if(pos1<pos2) { char temp=str[pos1]; str[pos1]=str[pos2]; str[pos2]=temp; return rev(str,pos1+1,pos2-1); } return str; } You can call this function like this char *r=rev("reverse it",0,9);
What causes a recursive algorithm to stop calling itself?
If the condition has been reached.
Are all patterns recursive?
No, patterns with terms that are not based upon previous terms are not recursive. Example: i * i where i is the nth term of the pattern.
How can you convert a simple algorithm to recursive algorithm?
Linear search(a,item) n=length(a) for i=1 to n do if(a[i]==item) then return i end for return -1
Explain non-recursive and recursive algorithm for postorder traversal on binary tree?
Step 1:- select first root node (t), start travelsing left contin
What is recursive algorithm?
Algorithm can be defined as an interpretable, finite set of instructions for dealing with contigencies and accompanying task that has recognizable end-points for given inputs. It is a tool for solving a well computational problem. A recursive algorithm is one which calls itself.
Design recursive algorithm for computing 2n for any non negative integer n which is based on the formula2n2n-1 2n-1?
The formula, as far as I can see, is not appropriate for the algorithm.
What is the maximum depth of recursive calls a function may make?
Recursive function call depend your primary memory space because the recursive call store in stack and stack based on memory.
