快速排序与冒泡排序效率对比

//C# Code

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Timers;

 

namespace QuickSort
{
    class Program
    {
        private static int UsedTime = 0;
        private static Random Seed = new Random();//Random Seed

 

        /// <summary>
        /// SortMethod
        /// </summary>
        /// <param name="arr">NumArray</param>
        /// <param name="begin">FirstIndex</param>
        /// <param name="end">LastIndex</param>
        /// <param name="isRandomKey">IsRandomKey</param>
        private static void QuickSort(int[] arr,int begin,int end,bool isRandomKey)
        {
            //The leftindex less than the rightindex,the sorting isn't complete.
            if (begin < end)
            {
                int i = begin - 1, j = end + 1, key;
                if (!isRandomKey)
                    key = arr[(begin + end) / 2];
                else
                    key = arr[Seed.Next(begin, end)];

                while (true)
                {
                    while (i < end && arr[++i] < key) ;
                    while (j > 0 && arr[--j] > key) ;

                    if (i >= j)
                        break;
                    Swap(arr, i, j);
                }
                QuickSort(arr, begin, i - 1,isRandomKey);//Left part recursion.
                QuickSort(arr, j + 1, end,isRandomKey);//Right part recursion.
            }
        }//end SortMethod

        /// <summary>
        /// SortMethod
        /// </summary>
        /// <param name="arr">NumArray</param>
        private static void BubbleSort(int[] arr)
        {
            int i,j;
            for (i = 0; i < arr.Length - 1; i++)
            {
                for (j = 0; j < arr.Length - 1 - i; j++)
                {
                    if (arr[j] > arr[j + 1])
                    {
                        Swap(arr,j,j+1);
                    }
                }
            }
        }//end SortMethod

        /// <summary>
        /// Swap variables' values
        /// </summary>
        /// <param name="arr">Array</param>
        /// <param name="i">Current left index</param>
        /// <param name="j">Current right index</param>
        private static void Swap(int[] arr, int i, int j)
        {
            int temp = arr[i];
            arr[i] = arr[j];
            arr[j] = temp;
        }//end method

        //TimerEventMethod
        private static void TimerEvent(object source, ElapsedEventArgs e)
        {
            UsedTime++;
        }

 

        static void Main(string[] args)
        {
            int ArrLen = 0;//Array length
Reinput:
            Console.Write("Please input array length:");
            if (!int.TryParse(Console.ReadLine(), out ArrLen))
            {
                Console.WriteLine("Error input !");
                goto Reinput;
            }


            int[] NumArr = new int[ArrLen];
            int[] NumArr_2 = new int[NumArr.Length];


            Console.WriteLine("Assignment values ...");
            for (int i = 0; i < NumArr.Length; i++)//Assign values
            {
                NumArr[i] = Seed.Next(-1000, 1000);
            }
            Console.WriteLine("Assignment to complete.");

 

            Console.WriteLine("\nCopying array to array2 ...");
            for (int i = 0; i < NumArr.Length; i++)//Copy array
            {
                NumArr_2[i] = NumArr[i];
            }
            Console.WriteLine("Copy completed.");

 

            /*//Cancel the notes to output datas
            Console.Write("Before Sort:");
            foreach(int a in NumArr)
                Console.Write("{0} ",a);
             */


            Timer t = new Timer();//Create a timer to calculate used time.
            t.Elapsed += new ElapsedEventHandler(TimerEvent);
            t.Interval = 1;
            UsedTime = 0;
            Console.Write("\nBegin QuickSorting , please wait ......");
            t.Start();
            QuickSort(NumArr, 0, NumArr.Length - 1, false);
            t.Stop();
            t.Close();


            /*//Cancel the notes to output datas
            Console.Write("\n\n\nAfter Sorted:");
            foreach(int a in NumArr)
                Console.Write("{0} ",a);
             */
            Console.WriteLine("\nQuickSorting is Complete. Used time : {0} msec.",UsedTime);

 

            t = new Timer();//Create a timer to calculate used time.
            t.Elapsed += new ElapsedEventHandler(TimerEvent);
            t.Interval = 1;
            UsedTime = 0;
            Console.Write("\nBegin BubbleSorting , please wait ......");
            //Console.Write("\nBegin RandomQuickSorting ......");
            t.Start();
            BubbleSort(NumArr_2);
            //QuickSort(NumArr_2, 0, NumArr_2.Length - 1, true);
            t.Stop();
            t.Close();


            /*//Cancel the notes to output datas
            Console.Write("\n\n\nAfter Sorted:");
            foreach(int a in NumArr_2)
                Console.Write("{0} ",a);
             */
            Console.WriteLine("\nBubbleSorting is Complete. Used time : {0} msec.",UsedTime);
            //Console.WriteLine("\nRandomQuickSorting is Complete. Used time : {0} msec.",UsedTime);

            Console.ReadLine();
        }//end Main()
    }//end class
}//end namespace

//欢迎转载，请注明原创，感谢