Êý¾Ý½á¹¹×¨Òµ¿Î³ÌÉè¼ÆÊ®ÖÖÅÅÐòËã·¨±È½ÏÑù±¾

#include<> #include<> #define N 100 int p,q; int g=0;int h=0; //ÆðÅÝÅÅÐò

void gensort(int b[],int n) {

int i,j;int s=0,t=0; for(i=0;i

for(j=i+1;jb[j]) {

int temp=b[i]; b[i]=b[j]; b[j]=temp; s+=3; }}}

cout<<\Òƶ¯´ÎÊý=\½Ï´ÎÊý

±È=\}

//²åÈëÅÅÐò

typedef int KeyType;

struct rec {

KeyType key; };

typedef rec sqlist[N];

void insertsort(sqlist b,int n) {

int i,j;int s=0,t=0; for(i=2;i

b[0].key=b[i].key; s++; j=i-1;

t++;

while(b[0].key

b[j+1]=b[j]; j--; s++; t++; }

b[j+1]=b[0]; s++; }

cout<<\Òƶ¯´ÎÊý=\±È½Ï´ÎÊý=\}

//ÕÛ°ë²åÈëÅÅÐò void so(sqlist num,int n) { int s=0;

int low,high,m;//·Ö±ðÖ¸ÏòµÍ¡¢¸ß¡¢ÖеÄλÖÃ

int i,j,k=0,t;//i,jÑ­»· k½»»»´ÎÊý tÉÚ±ø

for(i=1;i

t=num[i].key ;

low=0;high=i-1;

while(low<=high) {

m=(low+high)/2;

if(t