c#冒泡排序算法示例

namespace 冒泡排序
{
    class Program
    {
        static void swap( ref int  atemp, ref int  btemp)//注意ref的使用
        {
            int temp = atemp;
            atemp = btemp;
            btemp = temp;
        }
        static void Main(string[] args)
        {
            int temp=0;
            int[]arr={23,44,66,76,98,11,3,9,7};
            Console.WriteLine("排序前的数组：");
            foreach(int item in arr)
            {
                Console.Write(item+" ");
            }
            Console.WriteLine();
            for(int i=0;i<arr.Length-1;i++)
            {
                for(int j=0;j<arr.Length-1-i;j++)
                {
                    if (arr[j] > arr[j + 1])
                          swap( ref  arr[j], ref arr[j + 1]);
                }
            }
           Console.WriteLine("排序后的数组：");
           foreach(int item in arr)
           {
               Console.Write(item+" ");
            }
            Console.WriteLine();
            Console.ReadKey();

        }
    }
}
</div>