c#实现所有经典排序算法

《c#实现所有经典排序算法》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、C#实现所有经典排序算法//选择排序  classSelectionSorter  {     privateintmin;     publicvoidSort(int[]arr)     {         for(inti=0;i

2、        }             intt=arr[min];             arr[min]=arr[i];             arr[i]=t;         }     }     staticvoidMain(string[]args)     {         int[]array=newint[]{1,5,3,6,10,55,9,2,87,12,34,75,33,47};         SelectionSorters=newSelectionSorter();         s.Sort(array);         for

3、each(intminarray)             Console.WriteLine("{0}",m);     }  }  //冒泡排序  classEbullitionSorter  {     publicvoidSort(int[]arr)     {         inti,j,temp;         booldone=false;         j=1;         while((j

4、0;iarr[i+1])                 {                     done=false;                     temp=arr[i];                     arr[i]=arr[i+1];//交换数据                     arr[i+1]=temp;                 }             }             j++;         

5、}     }      staticvoidMain(string[]args)     {         int[]array=newint[]{1,5,3,6,10,55,9,2,87,12,34,75,33,47};         EbullitionSortere=newEbullitionSorter();         e.Sort(array);         foreach(intminarray)             Console.WriteLine("{0}",m);      }  }  //快速排序  classQuickSorter

6、  {     privatevoidswap(refintl,refintr)     {         inttemp;         temp=l;         l=r;         r=temp;     }     publicvoidSort(int[]list,intlow,inthigh)     {         intpivot;//存储分支点         intl,r;         intmid;         if(high<=low)             return;         elseif(high==low+

7、1)         {             if(list[low]>list[high])                 swap(reflist[low],reflist[high]);             return;         }         mid=(low+high)>>1;         pivot=list[mid];         swap(reflist[low],reflist[mid]);         l=low+1;         r=high;