c#算法—-(三)希尔排序-.net教程,算法/线

using system;
public class shellsorter
{
  public void sort(int [] list)
  {
      int inc;
      for(inc=1;inc<=list.length/9;inc=3*inc+1);
      for(;inc>0;inc/=3)
      {
          for(int i=inc+1;i<=list.length;i+=inc)
        {
          int t=list[i-1];
          int j=i;
          while((j>inc)&&(list[j-inc-1]>t))
          {
            list[j-1]=list[j-inc-1];
            j-=inc;
          }
          list[j-1]=t;
        }
      }
    }
}
public class mainclass
{
    public static void main()
    {
    int[] iarrary=new int[]{1,5,3,6,10,55,9,2,87,12,34,75,33,47};
    shellsorter sh=new shellsorter();
    sh.sort(iarrary);
    for(int m=0;m<=13;m++)
    console.writeline("{0}",iarrary[m]);
      }
}