what is recursive programming?

Answer 1

.
Recrusion is the process where a function present in a program calls itself again and again, with the its body loop.

You could see the below link for more details.
http://www-128.ibm.com/developerworks/linux/library/l-recurs.html?ca=dgr-lnxw06Recursion

**********
Vasu M
**********

Answer 2

Recursion in computer programming defines a function in terms of itself. One example application of recursion is in recursive descent parsers for programming languages. The great advantage of recursion is that an infinite set of possible sentences, designs, or other data can be defined, parsed, or produced by a finite computer program.

One common example is the function used to calculate the factorial of an integer:
this is a pascal program

function Factorial(x: integer): integer;
begin
if x <= 1 then
Factorial := 1
else
Factorial := x * Factorial(x-1);
end

In this program u can c the function Factorial which accepts an integer parameter.In the program if the passed values is 1 or less than 1 it exists.else it keeps on calling the same function until it becomes 1.

Answer 3

Recursion is a tool not often used by imperative language developers, because it is thought to be slow and to waste space, but as the author demonstrates, there are several techniques that can be used to minimize or eliminate these problems. He introduces the concept of recursion and tackle recursive programming patterns, examining how they can be used to write provably correct programs. Examples are in Scheme and C.

For new computer science students, the concept of recursive programming is often difficult. Recursive thinking is difficult because it almost seems like circular reasoning. It's also not an intuitive process; when we give instructions to other people, we rarely direct them recursively.

For those of you who are new to computer programming, here's a simple definition of recursion: Recursion occurs when a function calls itself directly or indirectly.

It's very easy to become too involved in prematurely optimizing Java code in terms of code size or speed.

Answer 4

recursive means repeating itself.
there is many situatoin where we need to do the same thing changing some variable but the funcitonality of the work is same. Like you see urself in between two mirror facing one to one and tilt by slight angle. You will find many pictures of yours, just like that type of work we need a function which depict the same procedure. An in computer language recursive programming come

Answer 5

When the function/procedure calls itself then it is said to be recursive function

for eg

int factorial(int a)
{
if(a>1)
return a*factorial(a-1);
return a;
}

In the above example factorial is again called

Answer 6

My Lord Ganesh try this link and find out

http://en.wikipedia.org/wiki/Recursion_(computer_science)