Still looking for a sponsor
As I mention in my previous post, next single-line function to implement is Fibonacci number. By definition, the first two Fibonacci numbers are 0 and 1, and each remaining number is the sum of the previous two. Some sources omit the initial 0, instead beginning the sequence with two 1s. (by Wikipedia) There are some variants to calculate Fibonacci number. First one is recursion: Func<int, int> fib = null;
fib = n => (n < 2) ? 1 : fib(n-1) +...