answersLogoWhite

0


Best Answer

Recursion is when a function (procedure) calls itself.

Example:

int Fib (int n)

{

if ((n==1)(n==0))return 1;

else return Fib(n-1) + Fib(n-2);

}

User Avatar

Wiki User

13y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

14y ago

recursive definition of a function is defined in which the function is defined in terms of itself.here the fuction calls itself repetitively.

This answer is:
User Avatar

User Avatar

Wiki User

12y ago

Entirely different things, no point in comparison.

This answer is:
User Avatar

User Avatar

Wiki User

12y ago

Some algorithms use themselves to solve a part of the original problem, it is called recursion. A typical example is the Towers of Hanoi.

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Explain the term Recursion with example?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Which of the instruction is useful in case of recursion?

"if" is an example


Explain what the term data means and give an example?

shiting it


What is the difference between left recursion and right recursion in a grammar?

Recursion is what it's called when a function calls itself. When a function calls itself immediately before returning, it's called tail recursion. Tail recursion can be more efficiently written as iteration. In fact a good compiler will recognize tail recursion and compile it as iteration. There is no such thing as left or right recursion in C programming.


How do you use the term physical features in a sentence?

Example sentence - His physical features were difficult to explain.


What is the use of recursion function?

Read the part in your programming manual/text book about recursion. The short answer while easy does not tell you anything about the power or dangers of recursion. It is the power and dangers of recursion that is important because once understood you can use recursion to good effect without running out of stack space.


How many types of recursion are there in c language?

Recursion in c language is a method where the function calls itself, within or outside the scope. Using Recursion, complicated problems can be divided into smaller parts so that solving them becomes more manageable. The recursion technique is available in Java, JavaScript, and C++.serves the same purpose. The type of Recursion in C • Direct Recursion • Indirect Recursion. Direct Recursion Recursion can call the function n-number of times. In the case of direct Recursion, the function calls itself inside the same position or in the local scope Direct Recursion problems are the Fibonacci series, a program to print 50 natural numbers. Indirect Recursion In the case of Indirect Recursion, a function X calls function Y, and function Y calls any function Z. Under certain conditions, function Z calls function A. In this case, function A is indirectly related to function Z. Indirect Recursion is also known as mutual Recursion, as more than one function runs a program. It is a two-step recursive function call process for making a recursive function call. Below mentioned are also type of Recursion: Tail Recursion No Tail/Head Recursion Linear Recursion Tree Recursion Tail Recursion A function is said to be tail recursion if it calls itself and also calls the last or the previous statement executed in the process. Head Recursion A function is said to be Head Recursion if it calls itself and also calls the first or the beginning statement executed in the process. Linear Recursion A function is said to be a linear recursive function if it makes a single call to itself each time the procedure executes itself and grows linearly depending on the size of the problem. Tree Recursion Tree Recursion is different from linear Recursion. Rather than making only one call to itself, that function makes more than one recursive call to the process within the recursive function. Following are the steps to solve the recursive problem in C: Step 1: Create a function and assign the work a part should do. Step 2: Select the subproblem and assume that the function already works on the problem. Step 3: Get the answer to the subproblem and use it to resolve the main issue. Step 4: The 90% of the problem defined is solved.


What is direct recursion?

When a function calls itself it is called as direct recursion. A function calls other functions which eventually call the original function is called as indirect recursion.


What type of science is recursion?

Recursion is a computer science. Typically computer programers write a specific program to test out a theory of recursion based on the known facts to try to define the variable.


What actors and actresses appeared in Recursion - 2013?

The cast of Recursion - 2013 includes: Andy Bolton as Ethan


What is funcation?

Read the part in your programming manual/text book about recursion. The short answer while easy does not tell you anything about the power or dangers of recursion. It is the power and dangers of recursion that is important because once understood you can use recursion to good effect without running out of stack space.


Explain the method of translation of historical institutional term?

"Explain the method of translation of historical institutional term?" Institutional term and National institutional term? "Explain the method of translation of historical institutional term?"


What are the principles of recursion?

not sure