#include <iostream>using namespacestd;//-------Direct Insert SortvoidInsertsort (Elemtype a[],intN) {Elemtype x; inti,j; for(i=1; i<n;i++) {x=A[i]; for(j=i-1; j>=0; j--) if(X.STN<A[J].STN) a[j+1]=A[j]; Else Break; A[j+1]=x; }}//----------------------//-------Hill Sort-----voidShellsort (Elemtype a[],intN) {Elemtype x; inti,j,d; for(d=n/2;d >=1;d/=2) { for(i=d;i<n;i++) {x=A[i]; for(j=i-d;j>=0; j-=d) {if(X.STN<A[J].STN) a[j+d]=A[j]; Else Break; } a[j+d]=x; } }}///-----Direct Selection Sort--voidSelectsort (Elemtype a[],intN) {Elemtype x; inti,j,k; for(i=1; i<=n-1; i++) {k=i-1; for(j=i;j<=n-1; j + +) { if(A[J].STN<A[K].STN) k=J; } if(k!=i-1) {x=a[i-1]; a[i-1]=A[K]; a[k]=x; } }}//---------Bubble Sort----------voidBubblesort (Elemtype a[],intN) {Elemtype x; intI,j,flag; for(i=1; i<=n-1; i++) {flag=0; for(j=n-1; j>=i;j--) if(a[j].stn<a[j-1].stn) {x=a[j-1]; a[j-1]=A[J]; a[j]=x; Flag=1; } if(flag==0)return; }}intMain () {return 0; }
6, C + + version comparison of various sorts of cattle