using System;

using System.Reflection;

using NUnit.Framework;

​

namespace Xceptor{

public class Program

{

    public static void Main() 

    {

        var x = new NUnitLite.AutoRun().Execute(new string[]{"--test:Xceptor.FibonacciTests", "--noc"});

        Console.WriteLine("");

        Console.WriteLine("----------------------------------------------");

        Console.WriteLine(x==0?"All Test Passed... :¬)": string.Format("{0} tests failed... :¬(", x));

        Console.WriteLine("----------------------------------------------");

    }

}

​

// The Fibonacci numbers start with 1, 1 and continues such that each number is the sum of the previous two numbers.  The first 15 Fibonacci numbers are: 1    1    2    3    5    8    13    21    34    55    89    144    233    377    610

public class Fibonacci

{

    // Task: Complete this method to return the Fibonacci value based on the position passed in E.g. Position = 6 then return value = 8

    public int CalculateFib(int position)

    {

        return 0;

    }

}

[TestFixture]

public class FibonacciTests

{

    Fibonacci f;

​

    [SetUp]

    public void Setup()

    {

        f = new Fibonacci();

    }

    // The first 15 Fibonacci numbers are: 1    1    2    3    5    8    13    21    34    55    89    144    233    377    610

    [TestCase(1, 1, Description = "If position passed in is 1 then Fibonacci value returned is 1")]

    [TestCase(6, 8, Description = "If position passed in is 6 then Fibonacci value returned is 8")]

    [TestCase(15, 610, Description = "If position passed in is 15 then Fibonacci value returned is 610")]

    public void TestFib(int position, int expectedValue)

    {

        var actualValue = f.CalculateFib(position);

        Assert.AreEqual(expectedValue, actualValue);

    }

}

}

​