基础算法

//1-100递归相加
        public static int fun(int b )
        {
            if (b == 0 || b == 1)
                return 1;
            else
                return fun(b - 1) + b; 
        }
        //冒泡排序
        public static void fun2(int[] a, int len)
        {
            int i, j, temp;
            for (j = 0; j < len - 1; j++)
            {
                for (i = 0; i < len - 1 - j; i++)
                {
                    if (a[i] > a[i + 1])
                    {
                        temp = a[i];
                        a[i] = a[i + 1];
                        a[i + 1] = temp;
                    }
                }
            }
        }
        //斐波那契数列
         public void FeiBoNaQie()
        {
            int t1 = 0, t2 = 1, nextTerm = 0, n;
            Console.Write("输入一个正数: ");
            n = Convert.ToInt32(Console.ReadLine());
            nextTerm = t1 + t2;

            while (nextTerm <= n)
            {
                Console.Write( nextTerm+"    ");
                t1 = t2;
                t2 = nextTerm;
                nextTerm = t1 + t2;
            }
        }
        //斐波那契数列
        public void FeiBoNaQie2()
        {
            int i, n, t1 = 0, t2 = 1, nextTerm;

            Console.WriteLine("输出几项: ");
            n = Convert.ToInt32(Console.ReadLine());

            Console.WriteLine("斐波那契数列: ");

            for (i = 1; i <= n; ++i)
            {
                Console.WriteLine(t1+"   ");
                nextTerm = t1 + t2;
                t1 = t2;
                t2 = nextTerm;
            }
        }