Added TailRecursion

Author: linkdotnet

README.md

@@ -4,6 +4,7 @@ Contains all of my examples from various blog posts. You can find a comprehensiv
 
 | BlogPost                                                                                 | Publish Date |
 | ---------------------------------------------------------------------------------------- | ------------ |
+| [Tail-Recursion - Explained with the Fibonacci series](TailRecursion/)                   | 13.05.2022   |
 | [Modal Dialog component with Bootstrap in Blazor](ModalDialogComponent/)                 | 19.04.2022   |
 | [4 Different ways of creating an array](ArrayInitializePerformance/)                     | 14.04.2022   |
 | [Create a low allocation and faster StringBuilder - Span in Action](ValueStringBuilder/) | 03.04.2022   |

TailRecursion/Program.cs

@@ -0,0 +1,48 @@
+using BenchmarkDotNet.Attributes;
+using BenchmarkDotNet.Running;
+
+BenchmarkRunner.Run<Fibonacci>();
+
+public class Fibonacci
+{
+    public const int FibonacciOf = 25;
+
+    [Benchmark(Baseline = true)]
+    public int FibonacciIterativeCall() => FibonacciIterative(FibonacciOf);
+
+    [Benchmark]
+    public int FibonacciRecursiveCall() => FibonacciRecursive(FibonacciOf);
+
+    [Benchmark]
+    public int FibonacciTailRecursiveCall() => FibonacciTailRecursive(FibonacciOf);
+    
+    private static int FibonacciIterative(int n)
+    {
+        if (n <= 1) return n;
+
+        var (previous, current) = (0, 1);
+        for (var i = 2; i < n; i++)
+        {
+            (previous, current) = (current, current + previous);
+        }
+
+        return current;
+    }
+
+    private static int FibonacciRecursive(int n)
+    {
+        if (n <= 1) return n;
+
+        return FibonacciRecursive(n - 2) + FibonacciRecursive(n - 1);
+    }
+
+    private static int FibonacciTailRecursive(int n, int previous = 0, int current = 1)
+    {
+        if (n == 0)
+            return previous;
+        if (n == 1)
+            return current;
+        
+        return FibonacciTailRecursive(n - 1, current, previous + current);
+    }
+}

TailRecursion/README.md

@@ -0,0 +1,5 @@
+# Tail-Recursion - Explained with the Fibonacci series
+
+What is **Tail-Recursion**? We will discover this "special" form of recursion on the example of the *Fibonacci* series. Also we will check how much faster it is and why.
+
+Found [here](https://steven-giesel.com/blogPost/ccdbefd9-2875-49e6-929c-c5081d5b4d27)

TailRecursion/TailRecursion.csproj

@@ -0,0 +1,14 @@
+<Project Sdk="Microsoft.NET.Sdk">
+
+    <PropertyGroup>
+        <OutputType>Exe</OutputType>
+        <TargetFramework>net6.0</TargetFramework>
+        <ImplicitUsings>enable</ImplicitUsings>
+        <Nullable>enable</Nullable>
+    </PropertyGroup>
+
+    <ItemGroup>
+      <PackageReference Include="BenchmarkDotNet" Version="0.13.1" />
+    </ItemGroup>
+
+</Project>

TailRecursion/TailRecursion.sln

@@ -0,0 +1,16 @@
+
+Microsoft Visual Studio Solution File, Format Version 12.00
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "TailRecursion", "TailRecursion.csproj", "{B3CFD7EA-8C7B-45FE-9AFD-A9AA8F3E7CC8}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Any CPU = Debug|Any CPU
+		Release|Any CPU = Release|Any CPU
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{B3CFD7EA-8C7B-45FE-9AFD-A9AA8F3E7CC8}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{B3CFD7EA-8C7B-45FE-9AFD-A9AA8F3E7CC8}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{B3CFD7EA-8C7B-45FE-9AFD-A9AA8F3E7CC8}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{B3CFD7EA-8C7B-45FE-9AFD-A9AA8F3E7CC8}.Release|Any CPU.Build.0 = Release|Any CPU
+	EndGlobalSection
+EndGlobal