0°

{干货}C#几个常用的排序算法-记录




自己记录帖。

冒泡排序

using System;  
namespace BubbleSorter  
{  
public class BubbleSorter  
{  
public void Sort(int [] list)  
{  
int i,j,temp;  
bool done=false;  
j=1;  
while((j<list.Length)&&(!done))  
{  
done=true;  
for(i=0;i<list.Length-j;i++)  
{  
if(list[i]>list[i+1])  
{  
done=false;  
temp=list[i];  
list[i]=list[i+1];  
list[i+1]=temp;  
}  
}  
j++;  
}  

}  
}  
public class MainClass  
{  
public static void Main()  
{  
int[] iArrary=new int[]{1,5,13,6,10,55,99,2,87,12,34,75,33,47};  
BubbleSorter sh=new BubbleSorter();  
sh.Sort(iArrary);  
for(int m=0;m<iArrary.Length;m++)  
Console.Write("{0} ",iArrary[m]);  
Console.WriteLine();  
}  
}  
}  

选择排序

using System;  

namespace SelectionSorter  
{  
public class SelectionSorter  
{  
private int min;  
public void Sort(int [] list)  
{  
for(int i=0;i<list.Length-1;i++)  
{  
min=i;  
for(int j=i+1;j<list.Length;j++)  
{  
if(list[j]<list[min])  
min=j;  
}  
int t=list[min];  
list[min]=list[i];  
list[i]=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};  
SelectionSorter ss=new SelectionSorter();  
ss.Sort(iArrary);  
for(int m=0;m<iArrary.Length;m++)  
Console.Write("{0} ",iArrary[m]);  
Console.WriteLine();  

}  
}  
}  

插入排序

using System;  

namespace InsertionSorter  
{  
public class InsertionSorter  
{  
public void Sort(int [] list)  
{  
for(int i=1;i<list.Length;i++)  
{  
int t=list[i];  
int j=i;  
while((j>0)&&(list[j-1]>t))  
{  
list[j]=list[j-1];  
--j;  
}  
list[j]=t;  
}  

}  
}  
public class MainClass  
{  
public static void Main()  
{  
int[] iArrary=new int[]{1,13,3,6,10,55,98,2,87,12,34,75,33,47};  
InsertionSorter ii=new InsertionSorter();  
ii.Sort(iArrary);  
for(int m=0;m<iArrary.Length;m++)  
Console.Write("{0}",iArrary[m]);  
Console.WriteLine();  
}  
}  
}  

希尔排序

using System;  

namespace ShellSorter  
{  
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,13,6,10,55,99,2,87,12,34,75,33,47};  
ShellSorter sh=new ShellSorter();  
sh.Sort(iArrary);  
for(int m=0;m<iArrary.Length;m++)  
Console.Write("{0} ",iArrary[m]);  
Console.WriteLine();  
}  
}  
}  
「点点赞赏,手留余香」

    还没有人赞赏,快来当第一个赞赏的人吧!
站点出售中https://ikmoe.com/announcement/20357.html
2 条回复 A 作者 M 管理员
  1. 签到成功!签到时间:下午6:07:44每日打卡,生活更精彩哦~

  2. 签到成功!签到时间:下午7:16:56每日打卡,生活更精彩哦~

欢迎您,新朋友,感谢参与互动!欢迎您 {{author}},您在本站有{{commentsCount}}条评论