Pumpkin Ninja
Kage in the Making 👑
- Joined
- Oct 31, 2012
- Messages
- 15,554
- Reaction score
- 1,857
Does anyone know how recursion works? If so can you help me? And before you ask I've looked everywhere but could not find anything useful...
Programming Java help!!!!!!!!!
- Thread starter Pumpkin Ninja
- Start date
Pumpkin Ninja
Kage in the Making 👑
- Joined
- Oct 31, 2012
- Messages
- 15,554
- Reaction score
- 1,857
Nice try but I know what sour math is XD
Hexuze
Legendary Shinobi 🐸
- Joined
- May 19, 2011
- Messages
- 20,359
- Reaction score
- 1,533
Haha. Too bad my friend didn't. XD
abcplay57
Member
- Joined
- Aug 4, 2012
- Messages
- 73
- Reaction score
- 14
Recursion works like a loop. It "loops" by calling the method within itself. But to ensure that it doesn't go on forever, you need to include a base case that will end the recursion sequence. Usually in programming classes it has a format like (for example)...
private static void example(int counter)
{
//base case
if(counter == 10)
{
System.out.println("Recursion done");
}
else //recursive step
{
counter++;
example(counter);
}
}
After that make sure you call it first in the main method.
public static void main(String[] args)
{
example(0);
}
This is a reaaaally simple example.
private static void example(int counter)
{
//base case
if(counter == 10)
{
System.out.println("Recursion done");
}
else //recursive step
{
counter++;
example(counter);
}
}
After that make sure you call it first in the main method.
public static void main(String[] args)
{
example(0);
}
This is a reaaaally simple example.
sure.
All function are called with an activation record which is a data structure that contains all of the variables that are passed to the function and is placed on the program stack. A recursive function is a function that calls itself; each time it calls itself, a new activation record is created. The trick is to establish a stopping condition or otherwise call itself with different parameters so that eventually you reach the stopping condition.
As an example, here's a java function that prints "Sakura Sucks" 2^k times (call it with k =8 for 256 times).
static void SS(int k)
{
if(k == 0) System.out.println("Sakura Sucks");
else
{
SS(k - 1);
SS(k - 1);
}
}
It's the power of computers!
All function are called with an activation record which is a data structure that contains all of the variables that are passed to the function and is placed on the program stack. A recursive function is a function that calls itself; each time it calls itself, a new activation record is created. The trick is to establish a stopping condition or otherwise call itself with different parameters so that eventually you reach the stopping condition.
As an example, here's a java function that prints "Sakura Sucks" 2^k times (call it with k =8 for 256 times).
static void SS(int k)
{
if(k == 0) System.out.println("Sakura Sucks");
else
{
SS(k - 1);
SS(k - 1);
}
}
It's the power of computers!
UchihaLightning
Jōnin Strategist 🧠
- Joined
- Mar 13, 2014
- Messages
- 2,391
- Reaction score
- 114
6ari8
Jōnin Strategist 🧠
- Joined
- Jul 6, 2011
- Messages
- 2,209
- Reaction score
- 209
The main thing is to understand the Base Case and the Recursive case. Everything else is fairly simple.
I think the best example you can find for recursion is the factorial function. This example can help you:
I think the best example you can find for recursion is the factorial function. This example can help you:
You must be registered for see links
Hexuze
Legendary Shinobi 🐸
- Joined
- May 19, 2011
- Messages
- 20,359
- Reaction score
- 1,533
........ I don't like you :NO:_@:
WEHHAHAHAHAHAHHA! XD Oh man. :')
Wabbit
Banned
- Joined
- Nov 15, 2011
- Messages
- 11,335
- Reaction score
- 797
Recursion is the process of repeating itself several times until the condition is true.
A function calling it self is a recursive function.Idk java.
It would be like this in general for functions in C or C++
A function calling it self is a recursive function.Idk java.
It would be like this in general for functions in C or C++
Code:
function()
{
statement;
function(); //calling the same function.
}