原 最大公约数

        //穷举法
        public static Int32 GetMaxCommonDivisorWithExhaustion(Int32 biggerNum, Int32 smallerNum)
        {
            Int32 maxDivisor = 0;
            for (int index = 1; index < smallerNum / 2; index++)
            {
                if (biggerNum % index == 0 && smallerNum % index == 0)
                {
                    maxDivisor = index;
                }
            }
            return maxDivisor;
        }

        //更相减损法(递归)
        public static Int32 GetMaxCommonDivisorWithGxjsRecursionRecursion(Int32 biggerNum, Int32 smallerNum)
        {
            return biggerNum != smallerNum ? (smallerNum > (biggerNum - smallerNum) ? GetMaxCommonDivisorWithGxjsRecursionRecursion(smallerNum, biggerNum - smallerNum) : GetMaxCommonDivisorWithGxjsRecursionRecursion(biggerNum - smallerNum, smallerNum)) : biggerNum;
        }
        //更相减损法(非递归)
        public static Int32 GetMaxCommonDivisorWithGxjsRecursionNorecursion(Int32 biggerNum, Int32 smallerNum)
        {
            while (biggerNum != smallerNum)
            {
                if (smallerNum > biggerNum - smallerNum)
                {
                    int temp = smallerNum;
                    smallerNum = biggerNum - smallerNum;
                    biggerNum = temp;
                }
                else
                {
                    biggerNum -= smallerNum;
                }
            }
            return biggerNum;
        }

        //辗转相处法 （递归）
        public static Int32 GetMaxCommonDivisorWithGcdRecursion(Int32 biggerNum, Int32 smallerNum)
        {
            return biggerNum % smallerNum == 0 ? smallerNum : GetMaxCommonDivisorWithGcdRecursion(smallerNum, biggerNum % smallerNum);
        }
        //辗转相处法 （非递归）
        public static Int32 GetMaxCommonDivisorWithGcdNorecursion(Int32 biggerNum, Int32 smallerNum)
        {
            while (biggerNum % smallerNum != 0)
            {
                int temp = biggerNum;
                biggerNum = smallerNum;
                smallerNum = temp % smallerNum;
            }
            return smallerNum;
        }

   Stopwatch sw = new Stopwatch();
            sw.Reset();
            sw.Start();
            {
                for (int i = 0; i < 100000000; i++)
                {
                    GetMaxCommonDivisorWithGxjsRecursionRecursion(260, 60);
                }
            }
            sw.Stop();
            Console.WriteLine("更相减损法(递归)：" + sw.ElapsedMilliseconds);
            sw.Reset();
            sw.Start();
            {
                for (int i = 0; i < 100000000; i++)
                {
                    GetMaxCommonDivisorWithGxjsRecursionNorecursion(260, 60);
                }
            }
            sw.Stop();
            Console.WriteLine("更相减损法(非递归)：" + sw.ElapsedMilliseconds);


            sw.Reset();
            sw.Start();
            {
                for (int i = 0; i < 100000000; i++)
                {
                    GetMaxCommonDivisorWithGcdRecursion(260, 60);
                }
            }
            sw.Stop();
            Console.WriteLine("辗转相除法：" + sw.ElapsedMilliseconds);

            sw.Reset();
            sw.Start();
            {
                for (int i = 0; i < 100000000; i++)
                {
                    GetMaxCommonDivisorWithGcdNorecursion(260, 60);
                }
            }
            sw.Stop();
            Console.WriteLine("辗转相除法：(非递归)" + sw.ElapsedMilliseconds);

            sw.Reset();
            sw.Start();
            {
                for (int i = 0; i < 100000000; i++)
                {
                    GetMaxCommonDivisorWithExhaustion(260, 60);
                }
            }
            sw.Stop();
            Console.WriteLine("穷举法：" + sw.ElapsedMilliseconds);