yeonwooz/Fibonacci.cs Secret

## Fibonacci.cs

public static uint Fibo(uint n)
{
    if (n <= 1)     // 3. base case
    {
        return n;
    }

    // 1. recursive step
    return Fibo(n - 1) + Fibo(n - 2);
    // 2-1. output is sum of former two elements. it becomes next input.
}

	public static uint Fibo(uint n)
	{
	if (n <= 1) // 3. base case
	{
	return n;
	}

	// 1. recursive step
	return Fibo(n - 1) + Fibo(n - 2);
	// 2-1. output is sum of former two elements. it becomes next input.
	}