insertionsorter.cs

来自「5种.net写的排序的方法」· CS 代码 · 共 37 行

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

namespace IAXK.Sys
{
    /// <summary>
    /// 插入排序
    /// </summary>
    /// <typeparam name="T"></typeparam>
    [Serializable]
    public class InsertionSorter<T>:Sorter<T> where T:IComparable,IComparable<T>
    {
        /// <summary>
        /// 排序算法
        /// </summary>
        /// <param name="v"></param>
        /// <param name="ot"></param>
        protected override void Algorithm(T[] v, OrderType ot)
        {
            int j;
            T t;
            for (int i = 1; i < v.Length; i++)
            {
                t = v[i];
                j = i - 1;
                while ((j >= 0) && (CompareValue(t, v[j],ot) < 0))
                {
                    v[j + 1] = v[j];
                    j--;
                }
                v[j + 1] = t;
            }
        }
    }
}