【收藏】经典算法-C#四种排序算法

None.gif 原文请参考http://www.uml.org.cn/net/200603242.htm

None.gif 【导读】本文介绍了C#的四种排序算法:冒泡排序、选择排序、插入排序和希尔排序 
None.gif
None.gif 冒泡排序
None.gif
None.gif
using  System;
None.gif
None.gif
namespace  BubbleSorter 
None.gif
ExpandedBlockStart.gifContractedBlock.gif
dot.gif public class BubbleSorter 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifpublic void Sort(int [] list) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifint i,j,temp; 
InBlock.gif
InBlock.gif
bool done=false; 
InBlock.gif
InBlock.gifj
=1; 
InBlock.gif
InBlock.gif
while((j<list.Length)&&!done)) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif{ done=true; 
InBlock.gif
InBlock.gif
for(i=0;i<list.Length-j;i++) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
InBlock.gif
if(list[i]>list[i+1]) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
InBlock.gifdone
=false; 
InBlock.gif
InBlock.giftemp
=list[i]; 
InBlock.gif
InBlock.giflist[i]
=list[i+1]; 
InBlock.gif
InBlock.giflist[i
+1]=temp; 
InBlock.gif
ExpandedSubBlockEnd.gif}
 }
 
InBlock.gif
ExpandedSubBlockEnd.gifj
++; }
 
InBlock.gif
ExpandedSubBlockEnd.gif}
 }
 
InBlock.gif
InBlock.gif
public class MainClass 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifpublic static void Main() 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
int[] iArrary=new int[]dot.gif{1,5,13,6,10,55,99,2,87,12,34,75,33,47}; 
InBlock.gif
InBlock.gifBubbleSorter sh
=new BubbleSorter(); 
InBlock.gif
InBlock.gifsh.Sort(iArrary); 
InBlock.gif
InBlock.gif
forint m=0;m<iArrary.Length;m++) 
InBlock.gif
InBlock.gifConsole.Write(
"{0} ",iArrary[m]); 
InBlock.gif
InBlock.gifConsole.WriteLine(); 
InBlock.gif
ExpandedSubBlockEnd.gif}
 }
 
InBlock.gif
ExpandedBlockEnd.gif}
 
None.gif 
None.gif
None.gif 
None.gif
None.gif选择排序 
None.gif
None.gif
using  System; 
None.gif
None.gif
None.gif
namespace  SelectionSorter 
None.gif
ExpandedBlockStart.gifContractedBlock.gif
dot.gif public class SelectionSorter 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifprivate int min; 
InBlock.gif
InBlock.gif
public void Sort(int [] list) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifforint i=0;i<list.Length-1;i++) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif{ min=i; 
InBlock.gif
InBlock.gif
forint j=i+1;j<list.Length;j++) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifif(list[j]<list[min]) 
InBlock.gif
InBlock.gifmin
=j; 
InBlock.gif
ExpandedSubBlockEnd.gif}
 
InBlock.gif
InBlock.gif
int t=list[min]; 
InBlock.gif
InBlock.giflist[min]
=list[i]; 
InBlock.gif
InBlock.giflist[i]
=t; 
InBlock.gif
ExpandedSubBlockEnd.gif}
 }
 
InBlock.gif
ExpandedSubBlockEnd.gif}
 
InBlock.gif
InBlock.gif
public class MainClass 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifpublic static void Main() 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
int[] iArrary=new int[]dot.gif{1,5,3,6,10,55,9,2,87,12,34,75,33,47}; 
InBlock.gif
InBlock.gifSelectionSorter ss
=new SelectionSorter(); 
InBlock.gif
InBlock.gifss.Sort(iArrary); 
InBlock.gif
InBlock.gif
forint m=0;m<iArrary.Length;m++) 
InBlock.gif
InBlock.gifConsole.Write(
"{0} ",iArrary[m]); 
InBlock.gif
InBlock.gifConsole.WriteLine(); 
InBlock.gif
ExpandedSubBlockEnd.gif}
 }
 
InBlock.gif
ExpandedBlockEnd.gif}
 
None.gif 
None.gif
None.gif 
None.gif
None.gif插入排序 
None.gif
None.gif
using  System;
None.gif
None.gif
namespace  InsertionSorter 
None.gif
ExpandedBlockStart.gifContractedBlock.gif
dot.gif public class InsertionSorter 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifpublic void Sort(int [] list) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifforint i=1;i<list.Length;i++) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifint t=list[i]; 
InBlock.gif
InBlock.gif
int j=i; 
InBlock.gif
InBlock.gif
while((j>0&&(list[j-1]>t)) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif{ list[j]=list[j-1]; 
InBlock.gif
InBlock.gif
--j; 
InBlock.gif
ExpandedSubBlockEnd.gif}
 
InBlock.gif
ExpandedSubBlockEnd.giflist[j]
=t; }
 
InBlock.gif
ExpandedSubBlockEnd.gif}
 
InBlock.gif
ExpandedSubBlockEnd.gif}
 
InBlock.gif
InBlock.gif
public class MainClass 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifpublic static void Main() 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
int[] iArrary=new int[]dot.gif{1,13,3,6,10,55,98,2,87,12,34,75,33,47}; 
InBlock.gif
InBlock.gifInsertionSorter ii
=new InsertionSorter(); 
InBlock.gif
InBlock.gifii.Sort(iArrary); 
InBlock.gif
InBlock.gif
forint m=0;m<iArrary.Length;m++) 
InBlock.gif
InBlock.gifConsole.Write(
"{0}",iArrary[m]); 
InBlock.gif
InBlock.gifConsole.WriteLine(); 
InBlock.gif
ExpandedSubBlockEnd.gif}
 }
 
InBlock.gif
ExpandedBlockEnd.gif}
 
None.gif 
None.gif
None.gif 
None.gif
None.gif希尔排序 
None.gif
None.gif 希尔排序是将组分段,进行插入排序. 
None.gif
None.gif
using  System; 
None.gif
None.gif
namespace  ShellSorter 
None.gif
ExpandedBlockStart.gifContractedBlock.gif
dot.gif
InBlock.gif
InBlock.gif
public class ShellSorter 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
InBlock.gif
public void Sort(int [] list) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
InBlock.gif
int inc; 
InBlock.gif
InBlock.gif
for(inc=1;inc<=list.Length/9;inc=3*inc+1); 
InBlock.gif
InBlock.gif
for(;inc>0;inc/=3) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
InBlock.gif
forint i=inc+1;i<=list.Length;i+=inc) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
InBlock.gif
int t=list[i-1]; 
InBlock.gif
InBlock.gif
int j=i; 
InBlock.gif
InBlock.gif
while((j>inc)&&(list[j-inc-1]>t)) 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
InBlock.giflist[j
-1]=list[j-inc-1]; 
InBlock.gif
InBlock.gifj
-=inc; 
InBlock.gif
ExpandedSubBlockEnd.gif}
 
InBlock.gif
InBlock.giflist[j
-1]=t; 
InBlock.gif
ExpandedSubBlockEnd.gif}
 }
 
InBlock.gif
ExpandedSubBlockEnd.gif}
 }
 
InBlock.gif
InBlock.gif
public class MainClass 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gifpublic static void Main() 
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif
InBlock.gif
ExpandedSubBlockStart.gifContractedSubBlock.gif
int[] iArrary=new int[]dot.gif{1,5,13,6,10,55,99,2,87,12,34,75,33,47}; 
InBlock.gif
InBlock.gifShellSorter sh
=new ShellSorter(); 
InBlock.gif
InBlock.gifsh.Sort(iArrary); 
InBlock.gif
InBlock.gif
forint m=0;m<iArrary.Length;m++) 
InBlock.gif
InBlock.gifConsole.Write(
"{0} ",iArrary[m]); 
InBlock.gif
InBlock.gifConsole.WriteLine(); 
InBlock.gif
ExpandedSubBlockEnd.gif}
 }
 
InBlock.gif
ExpandedBlockEnd.gif}
 
None.gif

转载于:https://www.cnblogs.com/syringa-flz/archive/2006/12/29/606787.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值