繁体中文
设为首页
加入收藏
当前位置:ASP技术首页 >> ASP基础 >> C#排序算法大全

C#排序算法大全

2006-05-15 08:00:00  作者:  来源:互联网  浏览次数:0  文字大小:【】【】【
简介:C#排序算法大全 土人 2004-7-21 一、冒泡排序(Bubble) using System; namespace BubbleSorter { public class BubbleSorter { public void Sort(int[] list) { int i,j,temp; bool done=false; j=1; while((j
关键字:C# 算法 排序 大全

C#排序算法大全

土人

2004-7-21

一、冒泡排序(Bubble)

using System;

namespace BubbleSorter

{

public class BubbleSorter

{

public void Sort(int[] list)

{

int i,j,temp;

bool done=false;

j=1;

while((j

{

done=true;

for(i=0;ilist[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

Console.Write("{0} ",iArrary[m]);

Console.WriteLine();

}

}

}

二、选择排序(Selection)

using System;

namespace SelectionSorter

{

public class SelectionSorter

{

private int min;

public void Sort(int [] list)

{

for(int i=0;i

{

min=i;

for(int j=i+1;j

{

if(list[j]

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

Console.Write("{0} ",iArrary[m]);

Console.WriteLine();

}

}

}

三、插入排序(InsertionSorter)

using System;

namespace InsertionSorter

{

public class InsertionSorter

{

public void Sort(int [] list)

{

for(int i=1;i0)&&(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

Console.Write("{0}",iArrary[m]);

Console.WriteLine();

}

}

}

四、希尔排序(ShellSorter)

using System;

namespace ShellSorter

{

public class ShellSorter

{

public void Sort(int [] list)

{

int inc;

for(inc=1;inc0;inc/=3)

{

for(int i=inc+1;iinc)&&(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

Console.Write("{0} ",iArrary[m]);

Console.WriteLine();

}

}

}

责任编辑:admin
相关文章