c#冒泡排序

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Diagnostics;
namespace OrderDemo
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] arr = new int[] { 6, 2, 8, 9, 5, 7 ,6,11,23};
            Stopwatch myWc = new Stopwatch();
            myWc.Start();
            OrderBy(arr);
            myWc.Stop();
            foreach (int i in arr)
            {
                Console.WriteLine(i.ToString());
            }
            Console.WriteLine(myWc.Elapsed);
            arr = new int[] { 6, 2, 8, 9, 5, 7 ,6,11,23};
            myWc.Restart();
            OrderByT(arr);
            myWc.Stop();
            foreach (int i in arr)
            {
                Console.WriteLine(i.ToString());
            }
            Console.WriteLine(myWc.Elapsed);
            Console.ReadKey();
        }

        private static void OrderBy(int[] array)
        {
            int a = 0;
            for (int i = 0; i < array.Length; i++)
            {
                for (int j = 0; j < array.Length; j++)
                {
                    if (array[i] < array[j])
                    {
                        a = array[i];
                        array[i] = array[j];
                        array[j] = a;
                    }
                }
            }

        }

        private static void OrderByT(int[] array)
        {
            bool change = true;
            for (int i = array.Length - 1; i >= 0&&change; i--)
            {
                change = false;
                for (int j = 0; j < i; j++)
                {
                    if (array[j] > array[j + 1])
                    {
                        int a = 0;
                       a= array[j];
                       array[j] = array[j+1];
                       array[j + 1] = a;
                       change = true;

                    }
                }
            }
        }
    }
}