简单冒泡

        /// <summary>
        /// 简单冒泡
        /// </summary>
        /// <param name="a"></param>
        public static void sort(int[] a)
        {
            int c;

            /*冒泡排序*/
            for (int i = a.Length - 1; i >= 1; i--)
            {
                for (int j = 0; j < i; j++)
                {

                    if (a[j] < a[j + 1])
                    {
                        c = a[j];
                        a[j] = a[j + 1];
                        a[j + 1] = c;
                    }
                }
            }
        }