算法回顾(冒泡排序,递归法,根据指定字符串与字符计算字符串中字符出现数)

 

using System;
 using System.Collections.Generic;
 using System.Linq;
 using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
            //测试递归方法
            int i = 1;
            while (i < 30)
            {
                Console.Write(Reqursion(i) + "<|>");
                i++;
            }
            Console.ReadKey();

            //测试冒泡排序法
            int[] nums = new int[] { 1, 7, 3, 5, 2 };
            BubbleSort(nums);
            Console.ReadKey();

            //测试指定字符串出现指定字符数统计方法
            CheckStr("(C)2010MicroYrscienceCopyr","c");
            Console.ReadKey();
        }

        //实现1 1 2 3 5 8 13 ... N的递归方法
        private static int Reqursion(int num)
        {
            if (num <= 0)
            {
                return 0;
            }
            else if (num > 0 && num < 3)
            {
                return 1;
            }
            else
            {
                return Reqursion(num - 1) + Reqursion(num - 2);
            }
        }

        //冒泡排序法
        private static void BubbleSort(int[] Nums)
        {
            int TmpNum;
            for (int i = 0; i < Nums.Length; i++)
            {
                for (int j = 0; j < i; j++)
                {
                    if (Nums[i] > Nums[j])
                    {
                        TmpNum = Nums[i];
                        Nums[i] = Nums[j];
                        Nums[j] = TmpNum;
                    }                    
                }
            }
            Console.Write("\n\n");
            for (int x = 0; x < Nums.Length; x++)
            {
                Console.Write(Nums[x].ToString()+"<|>");
            }
        }

        //在指定字符串中查找指定字符出现次数
        private static void CheckStr(string str1,string str2)
        {
            string str = str1.Replace(str2, null);
            Console.Write("\n\n"+"字符串|" + str1 + "|中出现字符|" + str2 + "|的次数是|" + (str1.Length - str.Length));
        }
    }
}