asp.net C# 冒泡排序、選擇排序 代碼

首先定義排序過程中要用到的swap方法，用於交換兩個整數的值：

     

   /// <summary>
        /// 交換兩個整數的值
        /// </summary>
        /// <param name="aa">數1</param>
        /// <param name="bb">數2</param>
        private static void swap(ref int aa,ref int bb)
        {
            int temp;
            temp = bb;
            bb = aa;
            aa = temp;
        }

   // 冒泡排序
   class program
    {
        static void main(string[] args)
        {
            int[] a={1,2,5,7,9,8,10,6,4,3};
            bubblesort(a);
            for (int i = 0; i < a.length; i++)
                console.write(a[i] + " ");
            console.readkey();
        }
        /// <summary>
        /// 冒泡排序
        /// </summary>
        /// <param name="a">傳入要排序的數組</param>
        private static void bubblesort(int[] a)
        {
            for (int i = 0; i < a.length - 1; i++)
            {
                for (int j = 0; j < a.length - i - 1; j++)
                {
                    if (a[j] < a[j + 1])//降序排列
                    {
                        swap(ref a[j], ref a[j + 1]);
                    }
                }
            }
        }
   }

 //選擇排序
 class program
 {
        static void main(string[] args)
        {
            int[] a = { 1, 2,  4, 3,6,5,7,9,8 };
            selectionsort(a);
            for (int i = 0; i < a.length; i++)
                console.write(a[i] + " ");
            console.readkey();
        }
        /// <summary>
        /// 選擇排序
        /// </summary>
        /// <param name="a">傳入要排序的數組</param>
        private static void selectionsort(int[] a)
        {
            int k;
            for (int i = 0; i < a.length - 1; i++)
            {
                k = i;
                for (int j = i+1; j < a.length ; j++)
                {
                    if (a[j] < a[k])//升序排列
                    {
                        k = j;
                      
                    }
                }
                if(k!=i)
                    swap(ref a[i], ref a[k]);
            }
        }
     }