mergesort.cs

数据结构排序算法演示数据结构排序算法演示数据结构排序算法演示数据结构排序算法演示数据结构排序算法演示数据结构排序算法演示数据结构排序算法演示

using System;
using System.Collections.Generic;
using System.Text;

namespace GraphicsSort
{
    public class MergeSort:SortBase,ISortable
    {
        public MergeSort(int[] initList, System.Windows.Forms.Control ctlToDraw)
            : base("MergeSort", initList, ctlToDraw)
        {
            
        }


        #region ISortable 成员

        public void Sort()
        {
            SwapCount = 0;
            IsComplete = false;

            Merge_Sort(0, list.Length-1);

            IsComplete = true;

            if (sortComplete != null)
            {
                SortEventArgs e = new SortEventArgs();
                e.SwapCount = SwapCount;
                e.SortName = SortName;
                foreach (SortComplete sc in sortComplete.GetInvocationList())
                {
                    sc(ctl, e);
                }
            }

        }

        #endregion

        private void Merge_Sort(int i, int j)
        {
            if (i >= j)
                return;
            int mid = (i + j) / 2;
            Merge_Sort(i, mid);
            Merge_Sort(mid+1, j);
            Merge(i, mid, j);
        }

        /// <summary>
        /// 合并 i..m    , m+1..j
        /// </summary>
        /// <param name="i"></param>
        /// <param name="j"></param>
        /// <param name="k"></param>
        private void Merge(int i, int m, int j)
        {
            int t = i;
            for (int p = m + 1; p <= j; p++)
            {
                while ((list[t] <= list[p]) && (t<p))
                    t++;
                if (t < p)
                {
                    int tmp = list[p];
                    for (int k = p; k > t; k--)
                        list[k] = list[k - 1];
                    list[t] = tmp;
                    foreach (StepComplete sc in stepComplete.GetInvocationList())
                    {
                        sc(ctl, e);
                    }
                    SwapCount++;
                }
                else
                    break;
            }
            
        }

        public override event StepComplete stepComplete;
        public override event SortComplete sortComplete;

    }
}