迭代、递归

1.迭代

 public class Test    {        public static  void Main(string[] args)        {            int v = 0;            for (int i = 2; i <= 100; i++)            {                                    v= v + i;            }            Console.WriteLine(v);            Console.Read();        }    }

2、递归

 public static  void Main(string[] args)        {            int n = 10;            Console.WriteLine(Fibonacci(n));            Console.Read();        }        public static int Fibonacci(int n)        {            if (n < 0) return -1;            if (n == 0) return 0;            if (n == 1) return 1;            return Fibonacci(n - 1) + Fibonacci(n - 2);        }