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

1、选择排序

2Qw"qc
yc:b0class SelectionSorter   
v6JKRv @0{   
?pJQp4g)`@.Nz[q0    private int min;   
&SE
[N'[0    public void Sort(int[] arr)    51Testing软件测试网m7{:?)A6J5i6N
    {   
5PZ3sd#m1U0        for (int i = 0; i < arr.Length - 1; ++i)    51Testing软件测试网cz+R(@D
        {   
P~%pM-CA"~0            min = i;    51Testing软件测试网 WaLRY n'\^lo
            for (int j = i + 1; j < arr.Length; ++j)    51Testing软件测试网/DU|(^6?
wy
            {   
$l]7lY2kts0                if (arr[j] < arr[min])    51Testing软件测试网 }.jwB_-S2|
                    min = j;   
pK\~dz(N R0            }   
'ZG[D6qQI7b0            int t = arr[min];    51Testing软件测试网GDy8ks }F
            arr[min] = arr[i];    51Testing软件测试网 LmzK
N.E$us
            arr[i] = t;   
0uc0\6^X+Dak'Te
t [0        }    51Testing软件测试网t"~ wHb
    }    51Testing软件测试网#H,?9W!OO
    static void Main(string[] args)   
c8G(u!K%g7vI0    {    51Testing软件测试网oW#a,heel
        int[] array = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };    51Testing软件测试网j[H2yP
        SelectionSorter s = new SelectionSorter();   
ao.I&^uj"s%xj0        s.Sort(array);   
G MTG d*I0        foreach (int m in array)   
)C4r]@7d;d)D4_|0            Console.WriteLine("{0}", m);    51Testing软件测试网sae,@$J!n{ D
    }   
7Ng'Z0j-gPPj0}

bDoq4Kk.Jy02、冒泡排序51Testing软件测试网'G3v.HTSx

XM"n?Ps$US0class EbullitionSorter    51Testing软件测试网DK"c6p Rc3c0\L9R
{    51Testing软件测试网X,B.P/f!Z,~q
    public void Sort(int[] arr)   
:m l
\K`2US0    {   
-^,sTB6j7i'X0        int i, j, temp;   
p ] Zw
k8b Xu|0        bool done = false;   

xj3^PBo0        j = 1;    51Testing软件测试网?x1U7i'w
        while ((j < arr.Length) && (!done))//判断长度    51Testing软件测试网\
KSZ:t1?
        {   
,w_zN-}0            done = true;    51Testing软件测试网!Xa:P"yr
            for (i = 0; i < arr.Length - j; i++)   
2o5|K)K#\N'E7~0            {    51Testing软件测试网 u8ka)GDfU
                if (arr[i] > arr[i + 1])    51Testing软件测试网8Y0O eL;R;`9B6Lt%K
                {    51Testing软件测试网&]^T*_2KU-r
                    done = false;    51Testing软件测试网rG;GY*t0Te8N
                    temp = arr[i];    51Testing软件测试网2W-\8F`C(m9K/\R{
                    arr[i] = arr[i + 1];//交换数据    51Testing软件测试网oJM4Y5k)A#c Q
                    arr[i + 1] = temp;   
M.nrxL0                }    51Testing软件测试网"J EzkK]upM*\
            }   
"da |o0z#n](xZ0            j++;    51Testing软件测试网-f4g:h.lW%pj%e
        }    51Testing软件测试网`,d?`\xJ];d
    }   
$L;FkPPSw_d#~0  
V;p~,xD'\&n`u$L {0    static void Main(string[] args)    51Testing软件测试网;yT*U ca3h1vJn
    {   
.Is+|_%z0        int[] array = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };   
@;u7O8O1K }/Ktul1r0        EbullitionSorter e = new EbullitionSorter ();    51Testing软件测试网.we*^2[4o\!v4M ctZ
        e.Sort(array);   
3C P ?!cUW0        foreach (int m in array)   
!j-H-j.L5^5_)_ ~/|K0            Console.WriteLine("{0}", m);    51Testing软件测试网K|Q$xh
   51Testing软件测试网pdF?-fB
    }    51Testing软件测试网*zb2rp:X
} 51Testing软件测试网B*Es,y6U|,@

|T!@O(BN)dU0 51Testing软件测试网Sa*Mo rfWgQ&Z r

p3bf!f mP
X03、快速排序51Testing软件测试网@!G1x R#S6t

class QuickSorter   
;{1a.r8n8T k0{   
5F:e_ ^b!b_(g0    private void swap(ref int l, ref int r)   

uq]k6}\K~0    {   
`QO,P#L VOq1L4~0        int temp;   
]#hr?1j%|0        temp = l;   
2AmSJxN
\0        l = r;   
{ndA4x.QKO2}0Q F0        r = temp;    51Testing软件测试网[7z n tXC)GQx)\
    }    51Testing软件测试网,B*s`8pOY9Z
    public void Sort(int[] list, int low, int high)   
o#ZWMH$h0h0    {    51Testing软件测试网cy#R-o^)c_Zf6I
        int pivot;//存储分支点    51Testing软件测试网8^'g~ ?\;l!vY
        int l, r;    51Testing软件测试网,O_3T!R6H7WUy"o
        int mid;   
's$\j6peD&@na8e0        if (high <= low)    51Testing软件测试网cY2R%qBUu
            return;    51Testing软件测试网 E8E&]6kE1uoX _
~a
        else if (high == low + 1)    51Testing软件测试网5Bq0X;F6@9N!m
        {    51Testing软件测试网 DG!t7a p ].{a"e4|'X
            if (list[low] > list[high])    51Testing软件测试网 ZX'w%O*fFX L9b
                swap(ref list[low], ref list[high]);   
,` \jk(~Gs{0            return;   
E)C
Mw(PLMN5T&H h0\0        }   
O8s4K aTu@E0        mid = (low + high) >> 1;   
8q MAf t&Y0        pivot = list[mid];   
|+`Ek{;C8LN;SU0        swap(ref list[low], ref list[mid]);    51Testing软件测试网4e$J}/l0M(F L s5ld
        l = low + 1;   
)N wR0FG6Hh:k0        r = high;    51Testing软件测试网 n.Zh"gD^6v-`gv
Z
        do  
IB.y1^1m| }i0        {    51Testing软件测试网|#u&}N Yb
        while (l <= r && list[l] < pivot)   

S*yhxM5s*O0            l++;    51Testing软件测试网VL*`.I-P5G
        while (list[r] >= pivot)    51Testing软件测试网j+Tq1p%a];le\O#F
            r--;    51Testing软件测试网-S2}*Lk_ c9Y
            if (l < r)    51Testing软件测试网U f V,\oJA
                swap(ref list[l], ref list[r]);    51Testing软件测试网!])Eb%j)P K5o
        } while (l < r);   
3h#j]niIb0        list[low] = list[r];   
I'Y|B Z[:m-r
^a0        list[r] = pivot;   
-Ul]/e.@&H0        if (low + 1 < r)   
6]+n4t1XrE0            Sort(list, low, r - 1);    51Testing软件测试网a-Vv'U3{4x7U
        if (r + 1 < high)    51Testing软件测试网#H-N"m6k.qy*x[/Q0mO2k
            Sort(list, r + 1, high);   
g ~1X*~x-ut0    }    51Testing软件测试网7sY'\dg'za:Q K
  
W6y:v.QPaP+xq0    static void Main(string[] args)   
-Cz^DT0nPW0    {    51Testing软件测试网@
`MQFM0Z
        int[] iArrary = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };   
3G%bCC-xq&p0        QuickSorter q = new QuickSorter();   
ZOz:{Y&\0        q.Sort(iArrary, 0, 13);   
B(E6a\%y8D,`o*m+y0        for (int m = 0; m <= 13; m++)    51Testing软件测试网#is[q'U
[
K6[
            Console.WriteLine("{0}", iArrary[m]);   
/c5S(B0HwZ.S9?1C0    }    51Testing软件测试网teF8Z nVa/Ck
}   51Testing软件测试网#rIq}#r9_:\,jE

WH)zrMf04、插入排序

public class InsertionSorter   

x![YY1Eb0{   
L a`!aUZxFM0    public void Sort(int[] arr)    51Testing软件测试网5pR4W,a,{Y+v7qZ
    {    51Testing软件测试网*k n*H)f4\7l
        for (int i = 1; i < arr.Length; i++)    51Testing软件测试网'wfX.Q,Ca8F
        {   
}g5Og/j
nS0            int t = arr[i];    51Testing软件测试网{4_1INk,IV
            int j = i;    51Testing软件测试网?+Dy1g2^o
            while ((j > 0) && (arr[j - 1] > t))   
@"W3bF%q7v0            {   
kF%p8qo0                arr[j] = arr[j - 1];//交换顺序   
8Sp"^z#g gO0                --j;   
7iW"z,`K[0            }    51Testing软件测试网 e,w$e1~ S-x
            arr[j] = t;   
C?Kr!c;Q4k`"_0        }   
V2u4z"I3CI^0    }    51Testing软件测试网X2A7?d*p0H
    static void Main(string[] args)    51Testing软件测试网C'y$NO|x
    {    51Testing软件测试网2`A(vB ]-O[
        int[] array = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };   
YNGi'T E(H)d0        InsertionSorter i = new InsertionSorter();   
?G0uaX!L0        i.Sort(array);    51Testing软件测试网@e+t%| x,l&Tq
        foreach (int m in array)   
0DkJl/?*c w0            Console.WriteLine("{0}", m);     51Testing软件测试网EOw.E#ng
    }   
Fh V Q+?-Zd0}    51Testing软件测试网E},fD bv c:Z

`1[ t ZYr3qJJn0 

5、希尔排序

public class ShellSorter    51Testing软件测试网Vzw
Z5E6h/BM0j_
{    51Testing软件测试网IiULR2B|
    public void Sort(int[] arr)   
?}|[/b,No0    {    51Testing软件测试网YR2R{y|
        int inc;   
7YC"`Q(F;ZP+?W0        for (inc = 1; inc <= arr.Length / 9; inc = 3 * inc + 1) ;   
3Y'EU h"v%R0        for (; inc > 0; inc /= 3)   
u;q}2thBc#Dz `6[0        {   
0In Prt2`[5~]0D0            for (int i = inc + 1; i <= arr.Length; i += inc)    51Testing软件测试网H7o4K8Juu
            {   
u;V+g9|+U)x0                int t = arr[i - 1];    51Testing软件测试网Hg?*C8xm4U
                int j = i;   
x t c?$ONlC0                while ((j > inc) && (arr[j - inc - 1] > t))    51Testing软件测试网7fw;A1ifH3[a(Fr\
                {    51Testing软件测试网-];{%Fn#sI'h*Y/a(y
                    arr[j - 1] = arr[j - inc - 1];//交换数据    51Testing软件测试网2s,V"h[ ?
                    j -= inc;    51Testing软件测试网-q2}!Z
X7Nxjs#Q-Z
                }    51Testing软件测试网f,T#p1rQHn,n
                arr[j - 1] = t;   
y9j1^uum/B8V nRN0            }   
ox!LH{e|0        }   
M0\'LO(]dp0    }    51Testing软件测试网A jE+eOTpT/i-V D1]8S
  
v)X M:NP0GK0    static void Main(string[] args)   
j#?y Yl I#y0    {   
;@8HL~`8W/\Kz0        int[] array = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };    51Testing软件测试网8X+E#z%y*v-e*` L
        ShellSorter s = new ShellSorter();   
u
s2n*F-x|0        s.Sort(array);   
u
dYd |0        foreach (int m in array)   
j4SAPB$h\@K ~;s0            Console.WriteLine("{0}", m);    
3jK$@ t#P0    }   
{7I@$Y;ik:V#w)zZ0}   51Testing软件测试网]9yHi'_D{q,g em