Save it for yourself.
Public classFanxinghelper<t>wheret:icomparable {/// <summary> ///Bubble Sort Algorithm/// </summary> /// <param name= "Array" ></param> Publict[] Maopao (t[] array) {intLength =Array. Length; for(inti =0; I <= length-2; i++) { for(intj = length-1; j>=1; j--) { if(Array[j]. CompareTo (array[j-1]) <0) {T temp=Array[j]; ARRAY[J]= Array[j-1]; Array[j-1] =temp; } } } returnArray; } /// <summary> ///Direct Insert Sort/// </summary> /// <param name= "Array" ></param> /// <returns></returns> Publict[] Zhijiecharu (t[] array) {intLength =Array. Length; for(inti =1; I < length-1; i++) { intj =i; while(j>=1&&ARRAY[J]. CompareTo (array[j-1]) >0) {T temp=Array[j]; ARRAY[J]= Array[j-1]; Array[j-1] =temp; J--; } } returnArray; } /// <summary> ///Select Sort/// </summary> /// <param name= "Array" ></param> /// <returns></returns> Publict[] Xuanzhepaixu (t[] array) {intLength =Array. Length; for(inti =0; I <= length-2; i++) { intindex =i; for(intj = length-1; J >i; j--) { if(Array[j]. CompareTo (Array[index]) <0) {Index=J; } T Temp=Array[i]; Array[i]=Array[index]; Array[index]=temp; } } returnArray; } /// <summary> ///Hill Sort Algorithm/// </summary> /// <param name= "Array" ></param> /// <returns></returns> Publict[] Xierpaixu (t[] array) {intLength =Array. Length; for(inti = length/2;i>0; i=i/2) { for(intj = i; J < I; J + +) { if(Array[j]. CompareTo (Array[j-i]) >0) {T temp=Array[j]; intKey = J-i; while(Key >=0&& Array[key]. CompareTo (temp) >0) {Array[key+ i] =Array[key]; Key-=i; } Array[key+ i] =temp; } } } returnArray; } }
If there is a mistake, hope to point out ... Thank you
The main thing is that the beauty of. NET is a whim, so write this.
Reference:
Http://www.cnblogs.com/JimmyZhang/category/128644.html
Generic bubble, INSERT, select, Hill algorithm