希尔排序算法

1. using System;
3. namespace suanfa
4. {
5.     /// <summary>
6.     /// ShellSorter ：希尔排序算法。
7.     /// 将组分段,进行插入排序
8.     /// </summary>
9.     public class ShellSorter
10.     {
11.         public ShellSorter()
12.         {
13.             
14.         }
16.         public void Sort(int [] list) 
17.         { 
19.             int inc; 
21.             for(inc=1;inc<=list.Length/9;inc=3*inc+1); 
23.             for(;inc>0;inc/=3) 
24.             { 
26.                 for(int i=inc+1;i<=list.Length;i+=inc) 
27.                 { 
29.                     int t=list[i-1]; 
31.                     int j=i; 
33.                     while((j>inc)&&(list[j-inc-1]>t)) 
34.                     { 
36.                         list[j-1]=list[j-inc-1]; 
38.                         j-=inc; 
40.                     } 
42.                     list[j-1]=t; 
44.                 } 
45.             } 
47.         }
48.     }
49.      
51.     public class MainClassShell 
52.     {
53.         public static void MainShell() 
54.         { 
56.             int[] iArrary=new int[]{1,5,13,6,10,55,99,2,87,12,34,75,33,47}; 
58.             ShellSorter sh=new ShellSorter(); 
60.             sh.Sort(iArrary); 
62.             Console.WriteLine("希尔算法排序：");
64.             for(int m=0;m<iArrary.Length;m++) 
66.                 Console.Write("{0} ",iArrary[m]); 
68.             Console.WriteLine(); 
69.             Console.ReadLine();
70.         } 
71.     }
72. }
73.