13,767,443 members
alternative version

#### Stats

628.7K views
91 bookmarked
Posted 4 Jan 2011
Licenced CPOL

# Recursive methods using C#

, 23 Apr 2013
For beginners, Recursive introduction, Examples, Benefits and Defects. A part of Data structure.

## What is Recursive Function/Method?

A Method can call another methods but it can also call itself. When a mathod calls itself, it'll be named recursive method.
A Recursive usuallly, has the two specifications:

1. Recursive method calls itself so many times until being satisfied.
2. Recursive method has parameter(s) and calls itself with new parameter values.

So, what is recursive function? There is no difference between function and method except that functions are not utilizable outside of their classes. In C# we had only method but anonymous function has been added to C#, since .NET Framework 3.5. (more information)

So, it's better to say Recursive method instead of Recursive function and I say Recursive in this artcile.

## Why, when and how to use Recursive in our application?

"Any program that can be written using assignment, the `if-then-else` statement and the `while` statement can also be written using assignment, `if-then-else` and Recursion". (Fundamentals of Data Structure in C by Ellis Horowitz)

Recursive solution is a powerful and simple approach for complicated developments, but it can worsen performance because of using call stack again and again (sometimes scandal performance).

Look at the Diagram:

Call Stack Diagram

I'm going to give examples for a better conseption of its risks and rewards:

1. The Factorial

We know that the factorial (!) of a positive integer number is the product of all positive integers less than or equal to the number.

```0! = 1
1! = 1
2! = 2 * 1! = 2
3! = 3 * 2! = 6
...
n! = n * (n - 1)!```

The following code is a method to compute the Factorial (no recursive):

```public long Factorial(int n)
{
if (n == 0)
return 1;
long value = 1;
for (int i = n; i > 0; i--)
{
value *= i;
}
return value;
}```

Computing the Factorial by a recursive method. Shorter and clearer than previous code :

```public long Factorial(int n)
{
if (n == 0)//The condition that limites the method for calling itself
return 1;
return n * Factorial(n - 1);
}```

You know, the factorial of `n` is actually the factorial of `(n-1)` mutiplied by `n`, if `n `> 0.

Or:

`Factorial(n) returns Factorial(n-1) * n`

That is the returned value of the method; and before that, we need a condition:

`If n = 0 Then Return 1`

I think, the program logic is now clear and we can understand it.

2. The Fibonacci Numbers

The Fibonacci numbers are the numbers in the following sequence:

`0,1,1,2,3,5,8,13,21,34,55,…`

If F0 = 0 and F1= 1 then:

Fn = Fn-1 + Fn-2

The following code is a method to compute `F<sub>n</sub>` (no recursive and high performance):

```public long Fib(int n)
{
if (n < 2)
return n;
long[] f = new long[n+1];
f[0] = 0;
f[1] = 1;

for (int i = 2; i <= n; i++)
{
f[i] = f[i - 1] + f[i - 2];
}
return f[n];
}```

If we use recursive method, our code will be more simple, but a very poor performance:

```public long Fib(int n)
{
if (n == 0 || n == 1)//satisfaction condition
return n;
return Fib(k - 2) + Fib(k - 1);
}```

3. Boolean Compositions

Sometimes solving the problem is more complicated than the Fibonacci. For example, we want to show all possible compositions for n Boolean variables. In other words, if `n = 3`, then we must have the following output:

```true, true, true
true, true, false
true, false, true
true, false, false
false, true, true
false, true, false
false, false, true
false, false, false```

Solving this problem without a recursive function is not so easy and not simple, when we have quantities for `n`.

```public void CompositionBooleans(string result, int counter)
{
if (counter == 0)
return;

bool[] booleans = new bool[2] { true, false };

for (int j = 0; j < 2; j++)
{
StringBuilder stringBuilder = new StringBuilder(result);
stringBuilder.Append(string.Format("{0} ", booleans[j].ToString())).ToString();

if (counter == 1)
Console.WriteLine(stringBuilder.ToString());

CompositionBooleans(stringBuilder.ToString(), counter - 1);
}
}```

Now, we can use and call this method:

`CompositionBoolean(string.Empty, 3);`

For using Recursive, Ian Shlasko suggested this:

```public void BooleanCompositions(int count)
{
BooleanCompositions(count - 1, "true");
BooleanCompositions(count - 1, "false");
}

private void BooleanCompositions(int counter, string partialOutput)
{
if (counter <= 0)
Console.WriteLine(partialOutput);
else
{
BooleanCompositions(counter - 1, partialOutput+ ", true");
BooleanCompositions(counter - 1, partialOutput+ ", false");
}
}```

4. InnerExceptions

Recursive methods are useful for getting the last `innerException`:

```public Exception GetInnerException(Exception ex)
{
return (ex.InnerException == null) ? ex : GetInnerException(ex.InnerException);
}```

Why the last `innerException`?! That's beside the point. The subject of our talk is, if you want to get the last `innerException`, you can count on Recursive method.

This code:

`return (ex.InnerException == null) ? ex : GetInnerException(ex.InnerException);`

is abridgment of and equivalent to the following code:

```if (ex.InnerException == null)//Condition for limiting
return ex;
return GetInnerException(ex.InnerException);//Calling the method with inner exception parameter```

Now, when we have an exception, we can find the last `innerException `of the exception. For example:

```try
{
throw new Exception("This is the exception",
new Exception("This is the first inner exception.",
new Exception("This is the last inner exception.")));
}
catch (Exception ex)
{
Console.WriteLine(GetInnerException(ex).Message);
}```

5. Find Files

I used Recursive in the sample project that you can download it. It's able to search a path and get all files form the current folder and subfolders.

```private Dictionary<string, string> errors = new Dictionary<string, string>();
private List<string> result = new List<string>();

private void SearchForFiles(string path)
{
try
{
foreach (string fileName in Directory.GetFiles(path))//Gets all files in the current path
{
}

foreach (string directory in Directory.GetDirectories(path))//Gets all folders in the current path
{
SearchForFiles(directory);//The methods calls itself with a new parameter, here!
}
}
catch (System.Exception ex)
{
errors.Add(path, ex.Message);//Stores Error Messages in a dictionary with path in key
}
}```

The method seems not to have any satisfy condition because it will be satisfied in each directory automatically, if it iterates all files and doesn't find any subfolder there.

## Consequently

We can use iterative algorithms instead of recursive and have a better performance but we may also have time expense and None-Recursive Function. The point is we have to choose the best approach which depends on situations.

Dr. James McCaffrey believes that don't use Recursive unless necessary. Read his article.

I prefer to:
A) Avoid using Recursive when the performance is a very-very important critical subject.
B) Avoid of using Recursive, when the iterative is not very "complicated".
C) Do not procrastinate about using Recursive, if (!A && !B)

For example:

Section 1 (Factorial): The iterative is not complicated then avoid recursion.

Section 2 (Fibonacci): Recursive like that is not recommended.

Of course it doesn't reduce the value of Recursive; I can remind Minimax algorithm (an important chapter in Artificial Intelligence) that Recursive is its all.

But if you decided to use a recursive method, it's better to try optimizing it with Memoization.

Good luck!

## Share

 Software Developer (Senior) Iran (Islamic Republic of)
Microsoft Certified Technology Specialist (MCTS)

"شاهین خورشیدنیا"

Nobody is perfect and neither am I, but I am trying to be more professional. In my humble opinion, you have to develop your skills, as long as you are responsible for developing even a tiny part of a sustainable software. That makes this job so special to me.

## You may also be interested in...

 Pro

 First PrevNext
 Fibonacci Petr Kubelka9-May-15 1:14 Petr Kubelka 9-May-15 1:14
 Re: Fibonacci Shahin Khorshidnia19-Jun-16 8:05 Shahin Khorshidnia 19-Jun-16 8:05
 A tidbit of nice chocolate 5/5 Frank R. Haugen13-Feb-14 10:51 Frank R. Haugen 13-Feb-14 10:51
 My vote of 2 Jason Curl28-Apr-13 3:21 Jason Curl 28-Apr-13 3:21
 My vote of 2 Cindy Meister24-Apr-13 7:40 Cindy Meister 24-Apr-13 7:40
 Thank you. Shahin Khorshidnia24-Apr-13 9:51 Shahin Khorshidnia 24-Apr-13 9:51
 [My vote of 1] Not this crap again. FatCatProgrammer24-Apr-13 5:02 FatCatProgrammer 24-Apr-13 5:02
 Thank you. Shahin Khorshidnia24-Apr-13 9:53 Shahin Khorshidnia 24-Apr-13 9:53
 Re: [My vote of 1] Not this crap again. Leo5629-Apr-13 8:14 Leo56 29-Apr-13 8:14
 Thanks Shahin Khorshidnia29-Apr-13 9:42 Shahin Khorshidnia 29-Apr-13 9:42
 StackoverflowException 23-Apr-13 10:14 23-Apr-13 10:14
 Re: StackoverflowException Shahin Khorshidnia23-Apr-13 10:24 Shahin Khorshidnia 23-Apr-13 10:24
 My vote of 2 jfriedman23-Apr-13 10:12 jfriedman 23-Apr-13 10:12
 Thanks Shahin Khorshidnia23-Apr-13 10:25 Shahin Khorshidnia 23-Apr-13 10:25
 My vote of 5 _Vitor Garcia_26-Feb-13 23:42 _Vitor Garcia_ 26-Feb-13 23:42
 Re: My vote of 5 Shahin Khorshidnia27-Feb-13 1:15 Shahin Khorshidnia 27-Feb-13 1:15
 Re: My vote of 5 _Vitor Garcia_27-Feb-13 1:33 _Vitor Garcia_ 27-Feb-13 1:33
 My vote of 3 Vitaly Tomilov21-May-12 9:59 Vitaly Tomilov 21-May-12 9:59
 Thank you Shahin Khorshidnia15-Jul-12 0:15 Shahin Khorshidnia 15-Jul-12 0:15
 Thank you for the points If we don't know that we don't know, we'll stay double ignorant for ever.
 Re: Thank you _groo_23-Apr-13 2:20 _groo_ 23-Apr-13 2:20
 Re: Thank you Shahin Khorshidnia23-Apr-13 9:16 Shahin Khorshidnia 23-Apr-13 9:16
 My vote of 2 Jasmine250115-May-12 7:49 Jasmine2501 15-May-12 7:49
 Re: My vote of 2 Shahin Khorshidnia15-May-12 8:20 Shahin Khorshidnia 15-May-12 8:20
 Re: My vote of 2 Jasmine250116-May-12 7:11 Jasmine2501 16-May-12 7:11
 Re: My vote of 2 Jasmine250116-May-12 7:14 Jasmine2501 16-May-12 7:14
 Last Visit: 16-Nov-18 16:39     Last Update: 16-Nov-18 16:39 Refresh 12345 Next »