绝对有你要的，超全排序+数据结构算法动画演示swf

#include "setting.h" /*------------------------------------------1.快速排序--------------------------------------*/ void QKSort(SqList &L,int low,int high ) { int pivotloc; if(low<high) { pivotloc=Partition(L, low, high); QKSort(L, low,pivotloc-1); QKSort(L, pivotloc+1, high); } } int Partition(SqList &L,int low,int high) { int pivotKey; L.r[0]=L.r[low]; pivotKey= L.r[low].Key; while ( low<high ) { while (low< high && L.r[high].Key>=pivotKey ) high--; if ( low <high ) { L.r[low]= L.r[high]; low++; } while (low<high &&L.r[low].Key<=pivotKey ) low++; if ( low<high ) { L.r[high]= L.r[low]; high--; } } L.r[low]= L.r[0]; return low; } /*--------------------------------------------2.堆的排序------------------------------------------*/ void HeapAdjust(HeapType &H, int s, int m) { int j; RedType rc; rc=H.r[s]; for(j=2*s;j<=m;j*=2) { if(j<m && LT(H.r[j+1].Key,H.r[j].Key)) ++j; if(LT(rc.Key,H.r[j].Key)) break; H.r[s]=H.r[j]; s=j; } H.r[s]=rc; } void HeapSort(HeapType &H) { int i; RedType t; for (i=H.length/2; i>0; --i) { HeapAdjust(H,i,H.length); } for (i=H.length; i>1; --i) { t = H.r[1]; H.r[1] =H.r[i]; H.r[i]= t; HeapAdjust(H,1,i-1); } } /*------------------------------------------3.冒泡排序--------------------------------------*/ void BubbleSort(SqList &L) { int n,i,j; n=L.length; RedType x; for ( i=1 ; i<= n-1 ;++i ) { for ( j=1 ; j<= n-i ; ++j) if (L.r[j].Key > L.r[j+1].Key ) { x= L.r[j]; L.r[j]= L.r[j+1]; L.r[j+1]= x; } } } /*------------------------------------------4.选择排序--------------------------------------*/ void SelectSort(SqList &L) { int i,j,k; RedType x; for ( i=1 ; i<= L.length-1; ++i) { k=i; for ( j=i+1 ; j<= L.length ; ++j) if (L.r[j].Key < L.r[k].Key ) k=j; if ( k!=i) { x= L.r[i]; L.r[i]= L.r[k]; L.r[k]=x; } } } /*------------------------------------------5.直接插入--------------------------------------*/ void InsSort(SqList &L) { int i,j; for (i=2; i<=L.length; i++) if(LT(L.r[i].Key,L.r[i-1].Key)) { L.r[0]=L.r[i]; L.r[i]=L.r[i-1]; for(j=i-2;LT(L.r[0].Key,L.r[j].Key);--j) L.r[j+1]=L.r[j]; L.r[j+1]=L.r[0]; } } /*------------------------------------------6.希尔排序--------------------------------------*/ void ShellSort(SqList &L, int dlta[], int t) { int k; void ShellInsert(SqList &, int ); for(k = 0; k < t; k++) ShellInsert(L, dlta[k]); } void ShellInsert(SqList &L, int dk) { int i, j; for(i = dk + 1; i <= L.length; i++) if(L.r[i].Key <= L.r[i - dk].Key) { L.r[0] = L.r[i]; for(j = i - dk; j > 0 && (L.r[0].Key <= L.r[j].Key); j -= dk) L.r[j + dk] = L.r[j]; L.r[j + dk] = L.r[0]; } } /*------------------------------------------7.归并排序--------------------------------------*/ void Merge(RedType SR[], RedType TR2[],int s, int m, int t) { int i,j,k; i=s; j=m+1; k=s; while ( (i<=m)&&(j<=t) ) { if ( SR[i].Key<=SR[j].Key ) { TR2[k]=SR[i]; ++i; } else { TR2[k]=SR[j]; ++j; } ++k; } while( i<=m ) { TR2[k]=SR[i]; k++; i++; } while( j<=t) { TR2[k]=SR[j]; k++; j++; } } void MSort(RedType SR[], RedType TR1[], int s, int t ) { int m; RedType TR2[20]; if ( s==t ) TR1[s]=SR[s]; else { m=(s+t)/2; MSort(SR,TR2,s, m); MSort(SR, TR2,m+1,t); Merge (TR2, TR1,s,m,t); } } void MergeSort ( SqList &L ) { MSort ( L.r, L.r ,1, L.length); } /*------------------------------------------8.折半排序--------------------------------------*/ void BinSort (SqList &L) { int i,j; for ( i=2; i<=L.length ; ++i ) { if(LT(L.r[i].Key,L.r[i-1].Key)) { L.r[0]=L.r[i]; L.r[i]=L.r[i-1]; for(j=i-2;LT(L.r[0].Key,L.r[j].Key);--j) L.r[j+1]=L.r[j]; L.r[j+1]=L.r[0]; } } }