c# 冒泡排序法

最新推荐文章于 2024-09-05 20:40:33 发布

转载最新推荐文章于 2024-09-05 20:40:33 发布 · 109 阅读

2007-09-25 14:57

using System;

namespace   BubbleSorter
{
/// <summary>
/// Class1 的摘要说明。
/// </summary>
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[] iArray = new int[]{1,5,13,6,10,55,99,2,87,12,34,75,33,47};
BubbleSorter sh = new BubbleSorter();
sh.Sort(iArray);
   for(int m=0;m<iArray.Length;m++)
   {
    Console.Write("{0}",iArray[m]);
    Console.WriteLine();
   }
   Console.Read();