阶乘、斐波那契数列、打印三角形（*）递归，冒泡排序

static int Show(int num)//Show(5)
 {           
            if (num <= 0)
                return 1;
            else
                return num*Show(num-1);         
}

 static int Show(int num)// Show(30)
        {
            if (num == 0 || num < 0)
                return 0;
            else if (num == 1 || num == 2)
                return 1;
            else
               return Show(num - 1) + Show(num - 2);
        }

static int Show(int num)//Show(5)
        {
            #region *的打印
            if (num<0)
                return;
            for (int i = 0; i < num; i++)
            {
                Console.Write("*");
            }
            Console.WriteLine();
            Show(num-1); 
            #endregion
        }

public static void Show() //从大到小
{
      int [] a={8,4,3,9,10,11};  
      int temp=0;
      for(int i=0;i<a.Length;i++)
    {
          for(int j=0;j<a.Length-i-1;j++)
          {
                 if(a[j]<a[j+1])
                {
                          temp=a[j];
                          a[j]=a[j+1];
                         a[j+1]=temp;
                }
          }
    }
}