你的分享就是我们的动力 ---﹥

C#四种排序算法(1)

时间:2011-09-18 15:36来源:www.chengxuyuans.com 点击:

冒泡排序

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(); 
}  }
}
  

本文地址http://www.chengxuyuans.com/C/14918.html