下面
例子是
个用C#实现希尔排序算法
；
=\"\">
=alt>=keyword>
ShellSorter
=\"\">{
=alt>=keyword>public=keyword>
ShellSorter
=\"\">{
=alt>=keyword>public=keyword>voidSort(=keyword>
list)
=\"\">{
=alt>=keyword>inc；
=\"\">=keyword>for(inc=1；inc＜=list.Length/9；inc=3*inc+1)；
=alt>=keyword>for(；inc＞0；inc/=3)
=\"\">{
=alt>=keyword>for(=keyword>i=inc+1；i＜=list.Length；i
inc)
=\"\">{
=alt>=keyword>t=list[i-1]；
=\"\">=keyword>j=i；
=alt>=keyword>while((j＞inc)&&(list[j-inc-1]＞t))
=\"\">{
=alt>list[j-1]=list[j-inc-1]；
=\"\">j-=inc；
=alt>}
=\"\">list[j-1]=t； [Page]
=alt>}
=\"\">}
=alt>}
=\"\">}
=alt>
=\"\">=keyword>public=keyword>MainClass
=alt>{
=\"\">=keyword>public=keyword>
=keyword>voidMain()
=alt>{
=\"\">=keyword>iArrary==keyword>
=keyword>{1,5,13,6,10,55,99,2,87,12,34,75,33,47}；
=alt>ShellSortersh==keyword>
ShellSorter()；
=\"\">sh.Sort(iArrary)；
=alt>=keyword>for(=keyword>m=0；m＜iArrary.Length；m
)
=\"\">{
=alt>Console.Write(=
>\"{0}\",iArrary[m])；
=\"\">Console.WriteLine()；
=alt>}
=\"\">}
=alt>}
=\"\">}
最新评论