06ÄêתÉý±¾Êý¾Ý½á¹¹¿¼Ìâ
Ò»¡¢ µ¥ÏîÑ¡ÔñÌ⣨¹²12 СÌ⣬ÿСÌâ2·Ö,¹²24·Ö£© 1¡¢ÒÑÖªµ¥Á´±í½á¹¹Îª struct node{ int data;
struct node *next; }*p,*q,*r ;
ɾ³ýµ¥Á´±íÖнáµãp(ÓÉpÖ¸ÏòµÄ½áµã)ºóÃæµÄ½áµãµÄ²Ù×÷²»ÕýÈ·µÄÊÇ__C__ A¡¢ q=p->next; p->next=q->next;
B¡¢p->next=p->next->next;
C¡¢r=p->next; p->next=q->next;
D¡¢q=p->next; r=q->next; p->next=r;
2¡¢Èô´ýÅÅÐò¶ÔÏóÐòÁÐÔÚÅÅÐòÇ°ÒѾ°´Õչؼü×ÖµÝÔöÅÅÁУ¬Ôò²ÉÓÃ__A__±È½Ï´ÎÊý×îÉÙ¡£
A¡¢Ö±½Ó²åÈëÅÅÐò O(n) B¡¢¿ìËÙÅÅÐò O(n2) C¡¢ºÏ²¢ÅÅÐò
D¡¢¼òµ¥Ñ¡ÔñÅÅÐò O(n2)
3¡¢Í¼µÄÉî¶ÈÓÅÏȱéÀúÀàËÆÓÚÊ÷µÄ__C__ A¡¢ºóÐò±éÀú B¡¢²ã´Î±éÀú C¡¢Ç°Ðò±éÀú D¡¢ÖÐÐò±éÀú
4¡¢Çó¸³È¨ÓÐÏòͼµÄ×î¶Ì·¾¶³£ÓõÄËã·¨ÓÐ___D___
A¡¢PrimËã·¨ºÍKruskalËã·¨ B¡¢PrimËã·¨ºÍDijkstraËã·¨ C¡¢KruskalËã·¨ºÍDijkstraËã·¨ D¡¢DijkstraËã·¨ºÍFloydËã·¨
5¡¢µ¥Á´±íÖÐÓÐn¸ö½áµã£¬ÔÚÆäÖвéÕÒֵΪxµÄ½áµã£¬ÔÚ²éÕҳɹ¦Ê±ÐèÒª±È½ÏµÄƽ¾ù´ÎÊýÊÇ___D___¡£ A¡¢n
B¡¢(n-1)/2 C¡¢n/2 D¡¢(n+1)/2 ½â´ð£º
²éѯÿ¸öÔªËØÐèÒª±È½Ï´ÎÊýÖ®ºÍ ²éѯƽ¾ù¸´ÔÓ¶È = ----------------------------------------------
ÔªËظöÊý
1 + 2 + 3 +... +n n+1 = ---------------------------- = --------
n 2
˼¿¼£ºÈç¹û²éÕÒ²»³É¹¦£¬¼ÆËã½á¹ûÈçºÎ£¿
6¡¢ÏßÐÔ±í²ÉÓÃÁ´Ê½´æ´¢Ê±£¬½áµãµÄ´æ´¢µØÖ·__B___ A¡¢±ØÐëÊDz»Á¬ÐøµÄ B¡¢Á¬ÐøÓë·ñ¾ù¿É C¡¢±ØÐëÊÇÁ¬ÐøµÄ
D¡¢ºÍÍ·½áµãµÄ´æ´¢µØÖ·ÏîÁ¬Ðø
7¡¢Ò»¿Ã·Ç¿ÕµÄ¶þ²æÊ÷ÖУ¬Éè¸ù½áµãÔÚµÚ0²ã£¬ÔÚµÚi²ãÉÏ×î¶àÓÐ___D__¸ö½áµã¡£ A¡¢2(i+1) B¡¢2i C¡¢2(i-1) D¡¢2i
¸ù ²ã0 1¸ö / \\
A B ²ã1 2¸ö
/ \\ / \\
A B C D ²ã2 4¸ö
8¡¢ÔÚÏÂÁеÄÅÅÐòËã·¨ÖУ¬Ëã·¨µÄʱ¼ä¸´ÔÓ¶ÈÊÇO(n*log2n)ÊÇ___D__¡£ A¡¢Ã°ÅÝÅÅÐò B¡¢¼òµ¥Ñ¡ÔñÅÅÐò C¡¢Ö±½Ó²åÈëÅÅÐò D¡¢¶ÑÅÅÐò
9¡¢Ê¹ÓÃÒ»¸öÕ»£¬Ã¿´ÎÏÞÖƽøÕ»ºÍ³öÕ»Ò»¸öÔªËØ¡£¼ÙÉè½øÕ»µÄÔªËØÐòÁÐÒÀ´ÎÊÇa¡¢b¡¢c¡¢d£»Ö¸³ö²»¿ÉÄܵijöÕ»ÐòÁÐ___B____¡£ A¡¢abcd B¡¢adbc
C¡¢acbd D¡¢dcba ½â´ð£º A¡¢ push(a)¡¢pop()¡¢push(b)¡¢pop()¡¢push(c)¡¢pop()¡¢push(d)¡¢pop(), B¡¢ û°ì·¨ C¡¢ push(a)¡¢pop()¡¢push(b)¡¢ push(c)¡¢pop()¡¢pop()¡¢push(d)¡¢pop() D¡¢ push(a)¡¢push(b)¡¢push(c)¡¢push(d)¡¢pop()¡¢pop()¡¢pop()¡¢pop()
10¡¢ÉèÊý×équeue[]×÷Ϊѻ·¶ÓÁÐQµÄ´æ´¢¿Õ¼ä£¬front×÷Ϊ¶ÓÍ·Ö¸Õ룬rear×÷Ϊ¶ÓβָÕ룬ÔòÖ´Ðгö¶Ó²Ù×÷ºóÆäÍ·Ö¸ÕëfrontµÄֵΪ__A___¡£ A¡¢front=(front+1)%m B¡¢front=(front+1)%(m-1) C¡¢front=(front-1)%m D¡¢front=front+1
½â´ð£ºÓë·½°¸1¡¢2Î޹ء£
11¡¢¶Ôͼ½øÐйã¶ÈÓÅÏȱéÀúʱ£¬Í¨³£²ÉÓÃ__C__À´ÊµÏÖ A¡¢×Ö·û´® B¡¢BÊ÷ C¡¢¶ÓÁÐ E¡¢ Õ»
12¡¢Ò»¸öÓÐn¸ö½áµãk²æÊ÷£¬Ê÷ÖÐËùÓнáµãµÄ¶ÈÊýÖ®ºÍÊÇ__B__¡£ A¡¢k+n B¡¢n-1 C¡¢kn D¡¢n2 ½â´ð£º
˼·1£ºÊ÷ÖнáµãµÄ¶ÈÊý=½áµãµÄ¶ù×ÓÊý n¸ö½áµãk²æÊ÷£¬Ã¿¸ö½áµã×î¶àÓÐk¸ö¶ù×Ó£¬Ò¶×ÓûÓжù×Ó£¬Òò´Ë´ð°¸²»ÊÇk*n¡£ ˼·2£ºÕýÈ·µÄ×ö·¨£º
Ê÷ÖÐËùÓнáµãµÄ¶ÈÊýÖ®ºÍ=Ê÷ÖÐËùÓбßÌõÊý£¬
ÿһÌõ±ßÖ¸ÏòÒ»¸ö½áµã£¬Ã¿¸ö½áµãÓÐÒ»ÌõÌìÏߣ¬Ö¸Ïò¸¸Ç×½áµã£¬³ýÁ˸ù½áµãÖ®Íâ¡£¹Ê´ð°¸ÊÇB£¬n-1
¶þ¡¢ Ìî¿ÕÌ⣨¹²8 СÌ⣬11¿Õ£¬Ã¿¿Õ2·Ö,¹²22·Ö£©
13¡¢ÒÑÖª¶þ²æÊ÷ºóÐòÁбíΪCEDBA£¬ÖÐÐòÁбíΪCBEDA£¬ÔòËüµÄÇ°ÐòÁбíΪ__ABCDE__¡£
½â´ð£ººóÐòÁбíΪCEDBA£¬Òò´Ë¸ùÊÇA£¬
ÖÐÐòÁбíΪCBEDA£¬Òò´Ë¸ùÖ»ÓÐ×ó×ÓÊ÷CBED£¬Ã»ÓÐÓÒ×ÓÊ÷
A /
CEDBºóÐò£¬¸ùÊÇB
CBEDÖÐÐò£¬×ó×ÓÊ÷C£¬ÓÒ×ÓÊ÷ED
A / B
/ \\
C EDºóÐò
EDÖÐÐò A / B
/ \\
C D
/ E
14¡¢N¸ö½áµãµÄÓÐÏòͼ£¬×î¶àÓÐ___N*(N-1)_____Ìõ±ß¡£
15¡¢´æ´¢Í¼µÄ×î³£Ó÷½·¨ÓÐÁ½ÖÖ£¬ËüÃÇÊÇ___ÁÚ½Ó¾ØÕó____ºÍ____ÁÚ½Ó±í____¡£ 16¡¢ÉèÓÐÒ»¸ö±ÕÉ¢ÁбíµÄÈÝÁ¿Îªm£¬ÓÃÏßÐÔ̽²â·¨½â¾ö³åÍ»£¬Òª²åÈëÒ»¸ö¼üÖµ£¬Èô²åÈë³É¹¦£¬ÖÁ¶àÒª½øÐÐ______±È½Ï¡£
17¡¢Ò»¿Ã¹þ·òÂüÊ÷ÓÐ29 ¸ö½áµã£¬ÆäÒ¶×ӵĸöÊýÊÇ___15____¡£ ½â´ð£º¹þ·òÂüÊ÷ûÓжÈΪ1µÄ½áµã£¬ Ò¶×ÓÊý=ÄÚ½áµãÊý+1 ½áµã×ÜÊý
=Ò¶×ÓÊý+ÄÚ½áµãÊý =2*Ò¶×ÓÊý-1 =2*ÄÚ½áµãÊý+1
18¡¢ÒÑÖªµ¥Á´±íµÄ½áµã¶¨ÒåΪ struct node{ int data;
struct node *next; };
ÔÚµ¥Á´±íÖÐËÑË÷½áµãp(ÓÉÖ¸ÏòµÄ½áµã)µÄºó¼Ì½áµãµÄ²Ù×÷ÊÇ____p=p->next___¡£ 19¡¢ÒÑ֪˫Á´±í½áµã¶¨ÒåΪ struct node{ int data;
struct node *left,*right; };
Ë«Á´±íÖнáµãµÄleftºÍright·Ö±ðÖ¸ÏòÇ°ÇýºÍºó¼Ì½áµã£¬ÔÚË«Á´±íÖÐɾ³ý½áµãp(ÓÉÖ¸ÏòµÄ½áµã)µÄ²Ù×÷ÊÇ£ºp->left->right=___p->right______£»ºÍp->right->left=___p->left_____¡£
20¡¢¶ÔÓÚ¶ÓÁУ¬Ö»ÄÜÔÚ__¶Óβ___²åÈëÔªËØ£¬ÔÚ___¶ÓÍ·____ɾ³ýÔªËØ¡£ Èý¡¢ Ó¦ÓÃÌ⣨¹²4СÌ⣬ÿСÌâ8·Ö£¬¹²32·Ö£© 21¡¢¶Ôͼ1ËùʾµÄÊ÷
£¨1£© ½áµãAµÄ¶ÈÊÇ_____3______¡£ £¨2£© Ê÷µÄ¶ÈÊÇ______3_____¡£
£¨3£© »³öÆäת»»³ÉÏàÓ¦¶þ²æÊ÷µÄÊ÷ÐÎ A
/ | \\ B C D
/ \\ / \\ E F G H /
I
½â´ð£ºÒ»°ãÊ÷ת»»³É¶þ²æÊ÷²½Ö裺
½«¸¸Ç×¹ÜÀí¶ù×Ó·½Ê½¸ÄΪ ¸¸Ç×¹ÜÀí´ó¶ù×Ó£¬
´ó¶ù×Ó¹ÜÀí¶þ¶ù×Ó£¨¶þ¶ù×Ó±ä³É´ó¶ù×ÓµÄÓÒº¢×Ó£©
¶þ¶ù×Ó¹ÜÀíÈý¶ù×Ó£¨Èý¶ù×Ó±ä³É¶þ¶ù×ÓµÄÓÒº¢×Ó£©
A ABEFCDGIH Ç°
/ EFBCIGHDA ÖÐ B
/ \\ FEIHGDCBAºó E C \\ \\ F D
/ G / \\ I H
22¡¢ÒÑÖª²Î¼ÓÅÅÐòµÄÕýÕûÊýÐòÁÐÊÇ£º90¡¢70¡¢180¡¢30¡¢520¡¢40¡¢60¡¢80¡¢50¡¢130¡£ÒÔµÚÒ»¸öÔªËØ90×÷Ϊ»ù×¼ÔªËØ£¬¸ù¾Ý¿ìËÙÅÅÐòËã·¨£¬Ð´³öÍê³ÉµÚÒ»ÌË»®·ÖºóÐòÁÐÖØÐÂÅÅÁеÄÇé¿ö¡£
60¡¢70¡¢50¡¢30¡¢80¡¢40¡¢90¡¢520¡¢180¡¢130
23¡¢Ò»´ÎÊäÈëÈçÏÂÐòÁÐÖеĸ÷¸öÕûÊý£¬¹¹ÔìÆäÏàÓ¦µÄ¶þ²æËÑË÷Ê÷£¬Ö»ÐèÒª»³ö×îºóÉú³ÉµÄ¶þ²æËÑË÷Ê÷µÄÊ÷ÐΡ£ÕûÊýÐòÁÐÊÇ180¡¢160¡¢250¡¢300¡¢170¡¢120¡¢125¡¢290¡¢380¡£
180
/ \\ 160 250 / \\ \\ 120 170 300
\\ / \\
125 290 380
24¡¢ÓÃPrimËã·¨Çóͼ2ËùʾµÄÎÞÏò´øȨÁ¬Í¨Í¼µÄ×îСÉú³ÉÊ÷¡£ÒªÇóÒÀ´Î»³ö´Ó¶¥µã1³ö·¢µÄ×îСÉú³ÉÊ÷µÄÉú³É¹ý³Ì¡£
1 \\ 4 1 / \\ 2 3¡ª 4 1 / \\ 2 4 1 / \\ 2 3¡ª 4 / 5
ËÄ¡¢ Ëã·¨Éè¼Æ£¨¹²2СÌ⣬µÚ25СÌâ10·Ö£¬µÚ26СÌâ12·Ö£¬¹²22·Ö£© 25¡¢¶þ²æÊ÷ÒÔ¶þ²æ±íΪ´æ´¢½á¹¹£¬½áµã½á¹¹µÄ¶¨ÒåÈçÏ£¬Çëд³öÒ»¸öÇó¶þ²æÊ÷ÖÐÒ¶×Ó½áµã¸öÊýµÄËã·¨¡£
typedef struct btnode *btlink; struct btnode{
TreeItem element; btlink left; btlink right; }Btnode
½â´ð£ºÓë05Ä꿼Ìâ²»Ò»Ñù
int f(Ö¸ÏòÊ÷¸ùµÄÖ¸Õë){//f()¼ÆËãÊ÷ÖÐÒ¶×Ó½ÚµãµÄ¸öÊý if(Ö¸ÏòÊ÷¸ùµÄÖ¸Õë==NULL)return 0;
x=f(Ö¸ÏòÊ÷¸ùµÄ×óº¢×ÓÖ¸Õë); //×ó×ÓÊ÷ÖÐÒ¶½ÚµãÊý£» y= f(Ö¸ÏòÊ÷¸ùµÄÓÒº¢×ÓÖ¸Õë);//ÓÒ×ÓÊ÷ÖÐÒ¶½ÚµãÊý£» if(root->left==NULL&&root->right==NULL)return 1;
else return x+y; /*»òÕß
if( x==0&&y==0)return 1; else return x+y;*/ }
int f ( btlink root ){//f()¼ÆËãÊ÷ÖÐÒ¶×Ó½ÚµãµÄ¸öÊý if(root==NULL)return 0;
x=f(root->left); //×ó×ÓÊ÷ÖÐÒ¶½ÚµãÊý£» y= f(root->right);//ÓÒ×ÓÊ÷ÖÐÒ¶½ÚµãÊý£» if(x==0&&y==0)return 1; else return x+y; }
T(n)=1+T(n1)+T(n2) n1+n2=n
=1+1+T(n11)+T(n12)+1+T(n21)+T(n22) n1=n11+n12 n2=n21+n22
25¡¢¶þ²æÊ÷ÒÔ¶þ²æ±íΪ´æ´¢½á¹¹£¬½áµã½á¹¹µÄ¶¨ÒåÈçÏ£¬Çëд³öÒ»¸öÇó¶þ²æÊ÷µÄ¸ß¶ÈËã·¨¡£ ½â´ð£º
int h(Ö¸ÏòÊ÷¸ùµÄÖ¸Õë){//f()¼ÆËãÊ÷¸ß¶È if(Ö¸ÏòÊ÷¸ùµÄÖ¸Õë==NULL)return 0;
x=h(Ö¸ÏòÊ÷¸ùµÄ×óº¢×ÓÖ¸Õë); //×ó×ÓÊ÷¸ß¶È£» y= h(Ö¸ÏòÊ÷¸ùµÄÓÒº¢×ÓÖ¸Õë);//ÓÒ×ÓÊ÷¸ß¶È£» if(x>y)return x+1; else return y+1;
//return (x>y?x:y) +1; }
26¡¢ÔĶÁÏÂÁгÌÐò£¬ËüÊÇÔÚÒÑÖªµÄÊý×éaÖвéÕÒÊýֵΪxµÄÔªËØ£¬Èç¹û´æÔÚÔòÊä³ö¡°found¡±£¬·ñÔòÊä³ö¡°not found¡±¡£ÊÔÎÊËüÊÇʲô·½·¨ÊµÏֵģ¿²¢ÇëÍêÉƳÌÐò¡£
ÓÃ__________²éÕÒ·¨¡£ #define N 10
void bs(int a[],int x){ int l,r,m; l=0;r=N-1;
m=___(l+r)/2______;
while((_____l<=r_______) && (x!=a[m]) ){ if(x>a[m]) l=_____m+1______; else r=m-1; m=(l+r)/2; }
if(___l<=r____)
printf(\ else
printf(\}
main(){
int a[N]={10,20,30,40,50,60,70,80,90,100}; int x;
printf(\ scanf(\ bs(____a, x_______); }
05רÉý±¾Êý¾Ý½á¹¹¿¼Ìâ
Ò»¡¢µ¥Ñ¡Ì⣺£¨Ã¿Ìâ2·Ö£¬¹²24·Ö£©
1¡¢Ë«ÏòÁ´±íµÄÒ»¸ö½áµãÓÐ( B )¸öÖ¸Õë¡£ A¡¢1 B¡¢2 C¡¢0 D¡¢3
2¡¢ÔÚn¸ö½áµãµÄ˳Ðò±íÖУ¬Ëã·¨µÄʱ¼ä¸´ÔӶȶ¼ÊÇO(1)µÄ²Ù×÷ÊÇ( A )¡£ A¡¢·ÃÎʵÚi¸ö½áµã(1¡Üi¡Ün)ºÍÇóµÚi¸ö½áµãµÄÖ±½ÓÇ°Ç÷(2¡Üi¡Ün) B¡¢ÔÚµÚi¸ö½áµãºó²åÈëÒ»¸öнáµã(1¡Üi¡Ün) C¡¢É¾³ýµÚi¸ö½áµã(1¡Üi¡Ün) D¡¢½«n¸ö½áµã´ÓСµ½´óÅÅÐò
3¡¢ÔÚ¶ÓÁÐÖдæÈ¡Êý¾ÝµÄÔÔòÊÇ( A )¡£ A¡¢ÏȽøÏȳö B¡¢ºó½øºó³ö? C¡¢ÏȽøºó³ö D¡¢²»½ø²»³ö
4¡¢ÔÚÕ»ÖУ¬³öÕ»²Ù×÷µÄʱ¼ä¸´ÔÓ¶ÈΪ( A )¡£ A¡¢O(1) B¡¢O(logn) C¡¢O(n) D¡¢O(n*n)
5¡¢É賤¶ÈΪnµÄÁ´¶ÓÁÐÓõ¥Ñ»·Á´±í±íʾ£¬ÈôÖ»ÉèÍ·Ö¸Õ룬ÔòÈ˶ӲÙ×÷µÄʱ¼ä¸´ÔÓ¶ÈΪ( C )¡£ A¡¢O(1) B¡¢0(logn) C¡¢0(n) D¡¢O(n*n)
6¡¢Èç¹û¶þ²æÊ÷µÄÒ¶½áµãÊýΪn0£¬Ôò¾ßÓÐË«·ÖÖ§µÄ½áµãÊýn2µÈÓÚ( D )¡£ A¡¢nO+l B¡¢n0 C¡¢2*n0 D¡¢n0-1
7¡¢Ò»¿Ã¶þ²æÊ÷Âú×ãÏÂÁÐÌõ¼þ£º¶ÔÈÎÒ»½áµã£¬Èô´æÔÚ×ó¡¢ÓÒ×ÓÊ÷£¬ÔòÆäÖµ¶¼Ð¡ÓÚËüµÄ×ó×ÓÊ÷ÉÏËùÓнáµãµÄÖµ£¬¶ø´óÓÚÓÒ×ÓÊ÷ÉÏËùÓнáµãµÄÖµ¡£ÏÖ²ÉÓÃ( B )±éÀú·½Ê½¾Í¿ÉÒԵõ½Õâ¿Ã¶þ²æÊ÷ËùÓнáµãµÄµÝÔöÐòÁС£ A¡¢Ïȸù B¡¢Öиù
C¡¢ºó¸ù D¡¢²ã´Î
8¡¢ÓÃÁÚ½Ó±í±íʾͼ½øÐÐÉî¶ÈÓÅÏȱéÀúʱ£¬Æä·ÇµÝ¹éË㷨ͨ³£²ÉÓà ( A )À´ÊµÏÖËã·¨¡£
A¡¢Õ» B¡¢¶ÓÁÐ C¡¢Ê÷ D¡¢Í¼
9¡¢¹ã¶ÈÓÅÏȱéÀúÀàËÆÓÚ¶þ²æÊ÷µÄ( D )¡£ A¡¢ÏÈÐò±éÀú B¡¢ÖÐÐò±éÀú C¡¢ºóÐò±éÀú D¡¢²ã´Î±éÀú
10¡¢ÔÚÒ»¸öÓÐÏòͼÖУ¬ËùÓж¥µãµÄÈ˶ÈÖ®ºÍµÈÓÚËùÓж¥µãµÄ³ö¶È Ö®ºÍµÄ( B )¡£ A¡¢1£¯2±¶ B¡¢1±¶ C¡¢2±¶ D¡¢4±¶
11¡¢ÈκÎÒ»¸ö´øȨÎÞÏòÁ¬Í¨Í¼µÄ×îСÉú³ÉÊ÷( B )¡£ A¡¢Ö»ÓÐÒ»¿Ã B¡¢Ò»¿Ã»ò¶à¿Ã C¡¢Ò»¶¨Óжà¿Ã D¡¢¿ÉÄܲ»´æÔÚ
12¡¢Éè·Ç¿Õµ¥Á´±íµÄÊý¾ÝÓòΪdata£¬Ö¸ÕëÓòΪnext£¬Ö¸ÕëPÖ¸Ïòµ¥Á´±íµÄµÚi¸ö½áµã£¬sÖ¸ÏòÉú³ÉµÄнáµã£¬ÏÖ½«s½áµã²åÈëµ½µ¥Á´±íÖУ¬Ê¹Æä³ÉΪµÚi½áµã£¬ÏÂÁÐËã·¨¶ÎÄÜÕýÈ·Íê³ÉÉÏÊöÒªÇó µÄÊÇ( C )¡£ A¡¢s->next=p->£»p->next=s
B¡¢p->next=s£»s->next=p->next£»
C¡¢S->next=p->next£»p->next=s£»½»»»p->dataºÍs->data D¡¢p=s£»s->next=p
¶þ¡¢Ìî¿ÕÌ⣨ÿ¿Õ2·Ö£¬¹²20·Ö£©
1¡¢Êý¾ÝµÄÂß¼½á¹¹·´Ó³_____³É·ÖÊý¾ÝÂß¼¹Øϵ______¡£
2¡¢¶ÔÓÚ¶ÓÁУ¬Ö»ÄÜÔÚ___¶Óβ_____²åÈëÔªËØ£¬ÔÚ____¶ÓÍ·_____ɾ³ýÔªËØ¡£ 3¡¢Ëã·¨ÊÇÒ»ÔËËãÐòÁУ¬ËüÓ¦ÓУºÓÐÏÞÐÔ¡¢____È·¶¨ÐÔ____¡¢¿ÉÐÐÐÔ¡¢¿ÉÒÔÎÞÈκÎÊäÈ룬µ«±ØÐë___ÓÐÊä³ö____¡£
4¡¢ÓÉÒ»¿Ã¶þ²æÊ÷µÄÇ°ÐòÐòÁкÍ____ÖÐÐòÐòÁÐ____¿ÉΨһȷ¶¨Õâ¿Ã¶þ²æÊ÷µÄ½á¹¹¡£
5¡¢Èç¹ûͼµÄ´æ´¢½á¹¹ÓÃ____ÁÚ½Ó±í/ÁÚ½Ó¾ØÕó___±íʾ£¬´Óijָ¶¨¶¥µã×÷Ϊ³õʼµã½øÐйã¶ÈÓÅÏÈËÑË÷£¬µÃµ½µÄ¹ã¶ÈÓÅÏÈËÑË÷ÐòÁÐΨһ¡£
6¡¢ÓÃDijkstraËã·¨Çóijһ¶¥µãµ½ÆäÓà¸÷¶¥µã¼äµÄ×î¶Ì·¾¶ÊÇ°´Â·¾¶³¤¶È____µÝÔö___µÄ´ÎÐòÀ´µÃµ½×î¶Ì·¾¶µÄ¡£
7¡¢ÏßÐÔ±í(a1£¬a2£¬a3£¬??an)(n>=1)ÖУ¬Ã¿¸öÔªËØÕ¼c¸ö´æ´¢µ¥Ôª£¬mΪa1Ê×µØÖ·£¬Ôò°´Ë³Ðò´æ´¢·½Ê½´æ´¢ÏßÐÔ±í£¬ai´æ´¢µØÖ·ÊÇ_____m+(i-1)*c___¡£ 8¡¢n¸ö½áµãµÄÎÞÏòͼ£¬×î¶àÓÐ___n*(n-1)/2__Ìõ±ß¡£ Èý¡¢Ó¦ÓÃÌâ (±¾´óÌâ¹²4СÌ⣬ÿСÌâ8·Ö£¬¹²32·Ö)
1¡¢ÓÃPrimËã·¨ÇóÏÂͼÁ¬Í¨µÄ´øȨͼµÄ×îС´ú¼ÛÉú³ÉÊ÷£¬ÔÚËã·¨Ö´ÐеÄijһ¿Ì£¬ÒÑÑ¡È¡µÄ¶¥µã¼¯ºÏU=[1£¬2£¬3]£¬±ßµÄ¼¯ºÏ TE=[(1£¬2)£¬(2£¬3)]£¬ÒªÑ¡È¡ÏÂÒ»ÌõȨֵ×îСµÄ±ß£¬Ó¦µ±´ÓÄÄЩ±ßÖÐÑ¡Ôñ?
2¡¢ÈôÓòåÈëÅÅÐò·½·¨¶ÔÏßÐÔ±í(25£¬84£¬21£¬47£¬]5£¬27£¬68£¬35£¬20)½øÐÐÅÅÐòʱ£¬Çë¸ø³öÇ°ËÄÌËÅÅÐò½áµãÐòÁеı仯Çé¿ö¡£ ´ð£º25
25 84 21 25 84 21 25 47 84 3¡¢ÒÑÖªÒ»¿Ã¶þ²æÊ÷µÄÖÐÐòÐòÁкͺóÐòÐòÁзֱðΪBDCEAFHGºÍDECBHGFA£¬Ç뻳ö¸Ã¶þ²æÊ÷¡£
A / \\
BDCE FHG ÖÐ DECB HGF ºó
4¡¢É轫ÕûÊýa£¬b£¬c£¬dÒÀ´Î½øÕ»£¬Çë»Ø´ð£ºÈôÈë¡¢³öÕ»´ÎÐòΪ Push(a)£¬Pop()£¬Push(b)£¬Push(c)£¬Pop()£¬Push(d)£¬Pop()£¬ Ôò³öÕ»µÄ×Ö·ûÐòÁÐÊÇʲô? ´ð£ºacd
ËÄ¡¢Ëã·¨Éè¼Æ (±¾´óÌâ¹²3СÌ⣬ÿСÌâ8·Ö£¬¹²24·Ö)
1¡¢¶þ²æÊ÷ÒÔ¶þ²æÁ´±íΪ´æ´¢½á¹¹£¬ÀàÐÍÉùÃ÷ÈçÏ£¬Çëд³öÒ»¸öÇó¶þ²æÊ÷Öнáµã¸öÊýµÄËã·¨¡£
typedef struct node{ datatype data£»
struct node *Lchild£» struct node *Rchild£» }BinaTree£»
´ð£ºint f(BinaTree *t){
if(t = = NULL) return; else
return f(t->left)+ f(t->right)+1;
}
2¡¢ÉèÏßÐÔ±íÓÃ˳Ðò½á¹¹ÊµÏÖ£¬ÉùÃ÷ÈçÏ£º typedef struct sqlist{ char data[maxsize]£» int n£»
}Sqlist;
Çëдһ¸öËã·¨£¬ÅжÏÆäÊÇ·ñ»ØÎÄ?(˳¶ÁÓëµ¹¶Á Ò»ÑùÈ磺¡°ababbaba\Ϊ»ØÎÄ) ´ð£º
½â·¨1£ºÐβκÍʵ²ÎÖ±½Ó´«µÝ½á¹¹±äÁ¿ #include
#define MAXLENGTH 100
typedef struct sqlist{
char data[MAXLENGTH]; int n; }Sqlist;
void f(Sqlist a){ int i;
if(a.n<=0)return;
for(i=0;i<(a.n)/2;i++){
if(a.data[i]!=a.data[a.n-i]){
printf(\return;
}
printf(\ } }
void main(){ Sqlist s;
printf(\ÊäÈën: \ scanf(\
printf(\ÊäÈë×Ö·û´®: \ scanf(\ f(s); }
½â·¨2£ºÐβÎÊÇÖ¸Õë±äÁ¿£¬Êµ²ÎÊǽṹ±äÁ¿µØÖ·Öµ void f(Sqlist *a){ int i;
if(a->n<=0)return; for(i=0;i<(a->n)/2;i++)
if(a->data[i]!=a->data[a->n-i-1]){ printf(\ return; }
printf(\}
void main(){
Sqlist s;
printf(\ scanf(\ printf(\ scanf(\ f(&s); }
½â·¨3£ºÀàËƽⷨ2£¬ÎªÖ¸Õë±äÁ¿¶¨ÒåÁËÀàÐÍList #include
#define MAXLENGTH 100
typedef struct sqlist *List;
typedef struct sqlist{
char data[MAXLENGTH]; int n; }Sqlist;
void f(List a){ int i;
if(a->n<=0)return; for(i=0;i<(a->n)/2;i++)
if(a->data[i]!=a->data[a->n-i-1]){ printf(\ return; }
printf(\}
void main(){ Sqlist s;
printf(\ scanf(\ printf(\ scanf(\ f(&s); }
3¡¢ÔĶÁÏÂÁгÌÐò£¬ÅжÏËüÊÇÓÃʲô·½·¨ÊµÏÖÅÅÐò(ÉýÐò)µÄ?²¢ÍêÉÆÏÂÁгÌÐò¡£ #include
void bubble(int[],int);
main(){
int array[]={55£¬2£¬6£¬4£¬32£¬12£¬9£¬73£¬26£¬37}; int size=sizeof(array)/sizeof(int)£» bubble(_array,10___)£» }
void bubble(int a[]£¬int size){ int i£¬temp£»
int end_____=0__________£» int pass=1£»
//======================= while(!end&&pass for(i=0£¬i end=___0__________£» } __pass++__________________; } //======================= for(i=0£»i µÚ¶þ²¿·Ö Êý¾Ý½á¹¹£¨¹²100·Ö£© Ò»¡¢µ¥ÏîÑ¡ÔñÌ⣨±¾´óÌâ¹²12СÌ⣬ÿСÌâ2·Ö£¬¹²24 ·Ö£© ÔÚÿСÌâÁгöµÄËĸö±¸Ñ¡ÏîÖÐÖ»ÓÐÒ»¸ö·ûºÏÌâÄ¿ÒªÇó£¬Ç뽫ÕýÈ·´ð°¸´úÂëÌîдÔÚ´ðÌâÖ½ÏàÓ¦µÄλÖÃÉÏ¡£Ð´ÔÚÊÔ¾íÉϲ»µÃ·Ö¡£ 1£®ÔÚ´ýÅÅÐò¼Ç¼ÒÑ»ù±¾ÓÐÐòµÄÇ°ÌáÏÂ,ÏÂÊöÅÅÐò·½·¨ÖÐЧÂÊ×î¸ßµÄÊÇ£º A)Ö±½Ó²åÈëÅÅÐò B)¼òµ¥Ñ¡ÔñÅÅÐò C)¿ìËÙÅÅÐò D)¹é²¢ÅÅÐò 2£®ÒÔÏÂÄÄÒ»¸öÊõÓïÓëÊý¾ÝµÄ´æ´¢½á¹¹Î޹أ¿ A)Õ» B)±ÕÉ¢Áбí C)ÏßË÷¶þ²æÊ÷ D)Ë«ÏòÁ´±í 3£®ÓÐ6¸öÔªËØ6,5,4,3,2,1µÄ˳Ðò½øÕ»£¬ÎÊÏÂÁÐÄÄÒ»¸ö²»ÊǺϷ¨µÄ³öÕ»ÐòÁУº A)5,4,3,6,1,2 B)4,5,3,1,2,6 C)3,4,6,5,2,1 D)2,3,4,1,5,6 4£®ÏÂÊöÄÄÒ»ÌõÊÇ˳Ðò´æ´¢·½Ê½µÄÓŵ㣿 A)´æ´¢Ãܶȴó B)²åÈëÔËËã·½±ã C)ɾ³ýÔËËã·½±ã D)¿É·½±ãµØÓÃÓÚ¸÷ÖÖÂß¼½á¹¹µÄ´æ´¢±íʾ 5£®¶ÔÓÚÖ»ÔÚ±íµÄÊס¢Î²½øÐвåÈë²Ù×÷µÄÏßÐÔ±í£¬Ò˲ÉÓõĴ洢½á¹¹Îª: A) ˳Ðò±í B) ÓÃÍ·Ö¸Õë±íʾµÄµ¥Ñ»·Á´±í C) ÓÃβָÕë±íʾµÄµ¥Ñ»·Á´±í D) µ¥Á´±í 6£®¶Ô°üº¬n¸öÔªËصÄÉ¢Áбí½øÐвéÕÒ£¬Æ½¾ù²éÕÒ³¤¶È A)ΪO(log2n) B)ΪO(n) C)ΪO(nlog2n) D)²»Ö±½ÓÒÀÀµÓÚn 7£®ÏÂÁÐÄÄÒ»ÖÖͼµÄÁÚ½Ó¾ØÕóÊǶԳƾØÕó£¿ A)ÓÐÏòͼ B)ÎÞÏòͼ C)AOVÍø D)AOEÍø 8. Éè±í (a1, a2, a3, ......, a32) ÖеÄÔªËØÒѾ°´µÝÔö˳ÐòÅźÃÐò£¬Óöþ·Ö·¨¼ìË÷ÓëÒ»¸ö¸ø¶¨µÄÖµkÏàµÈµÄÔªËØ£¬Èôa1 A£©2 B£©3 C£©4 D£©5 10£®¶Ô¶þ²æÊ÷´Ó1¿ªÊ¼±àºÅ£¬ÒªÇóÿ¸ö½áµãµÄ±àºÅ´óÓÚÆä×óÓÒº¢×ӵıàºÅ£¬Í¬Ò»¸ö½áµãµÄ×óÓÒº¢×ÓÖУ¬Æä×óº¢×ӵıàºÅСÓÚÆäÓÒº¢×ӵıàºÅ£¬ Ôò¿É²ÉÓõıàºÅ·½·¨ÊÇ£º A¡¢ÏÈÐò±éÀú B¡¢ÖÐÐò±éÀú C¡¢ºóÐò±éÀú D¡¢´Ó¸ù¿ªÊ¼½øÐвã´Î±éÀú 11. ÔÚ³¤¶ÈΪnµÄ˳Ðò±íµÄµÚi ( 1¡Ü i ¡Ün+1 )¸öλÖÃÉϲåÈëÒ»¸öÔªËØ£¬ÔªËØµÄ Òƶ¯´ÎÊýΪ£º A) n-i+1 B) n-i C) i D) i-1 12. ¶ÔÓÚÒ»¸öÎÞÏòͼ£¬ÏÂÁÐ˵·¨ÕýÈ·µÄÊÇ A)ÿ¸ö¶¥µãµÄÈë¶È´óÓÚ³ö¶È£» B)ÿ¸ö¶¥µãµÄ¶ÈµÈÓÚÆäÈë¶ÈÓë³ö¶ÈÖ®ºÍ£» C)ÎÞÏòͼµÄÁÚ½Ó¾ØÕóÒ»¶¨ÊǶԳƾØÕó£» D)ÓÐÏòͼÖÐËùÓж¥µãµÄÈë¶ÈÖ®ºÍ´óÓÚËùÓж¥µãµÄ³ö¶ÈÖ®ºÍ£» ¶þ¡¢Ìî¿ÕÌ⣨±¾´óÌâ¹²10СÌ⣬ÿ¿Õ2·Ö£¬¹²22 ·Ö£© ÇëÔÚ´ðÌâÖ½ÏàÓ¦µÄλÖÃÉÏÌîдÕýÈ·´ð°¸¡£Ð´ÔÚÊÔ¾íÉϲ»µÃ·Ö¡£ 13. ÉèÒ»¹þÏ£±í±í³¤MΪ100 £¬ÓóýÁôÓàÊý·¨¹¹Ôì¹þÏ£º¯Êý£¬¼´H£¨K£©=K % P £¨P<=M£©, Ϊʹº¯Êý¾ßÓнϺÃÐÔÄÜ£¬PӦѡ 97 14. N¸ö½áµãµÄ¶þ²æÊ÷²ÉÓöþ²æÁ´±í´æ·Å£¬¹²ÓпÕÖ¸ÕëÓò¸öÊýΪ N+1 15. ÈôÒ»¸öËã·¨ÖеÄÓï¾äƵ¶ÈÖ®ºÍΪT(n) = 3720n+4nlogn£¬ÔòËã·¨µÄʱ¼ä¸´ÔÓ ¶ÈΪ_______O(nlogn)_________ ¡£ 16. ÒÑÖªÓÐÏòͼµÄÁÚ½Ó¾ØÕó£¬Òª¼ÆËãiºÅ½áµãµÄÈë¶È£¬¼ÆËã·½·¨ÊÇ£º ½« µÚiÁÐ ÀÛ¼Ó¡£ 17. Éî¶ÈΪ6£¨¸ùÉî¶ÈΪ1£©µÄ¶þ²æÊ÷ÖÁ¶àÓÐ 63 ¸ö½áµã¡£ 18. Ò»¿Ã¾ßÓÐn¸öÒ¶×Ó½áµãµÄ¹þ·òÂüÊ÷ÖУ¬½áµã×ÜÊýΪ 2n-1 ¡£ 19. Éèµ¥Á´±í½áµãµÄ¶¨ÒåÈçÏ£º struct node{ int data, struct node *next; }; ÒªÔÚÒ»¸öµ¥Á´±íÖÐpËùÖ¸½áµãÖ®ºó²åÈëÒ»¸ö×ÓÁ´±í£¬×ÓÁ´±íµÚÒ»¸ö½áµãµÄµØַΪs£¬×ÓÁ´±í×îºóÒ»¸ö½áµãµÄµØַΪt, ÔòÓ¦Ö´ÐвÙ×÷£º t->next=p->next;________ ºÍ _________ p->next=s£» ¡£ 20. Éèµ¥Á´±í½áµãµÄ¶¨ÒåÈç19Ì⣬ÏÖÓÐÒ»¸öº¬Í·½áµãµÄµ¥Á´±í£¬Í·Ö¸ÕëΪhead, ÔòÅжϸõ¥Á´±íÊÇ·ñΪ¿Õ±íµÄÌõ¼þΪ head->next==NULL ¡£ 21. n¸ö¶¥µãµÄÁ¬Í¨ÎÞÏòͼÖÁÉÙÓÐ n-1 Ìõ±ß¡£ 22. ÔÚ˳Ðò´æ´¢½á¹¹µÄÏßÐÔ±íÖвåÈëÒ»¸öÔªËØ£¬Æ½¾ùÐèÒªÒƶ¯ n/2 ¸öÔªËØ. Èý¡¢Ó¦ÓÃÌ⣺£¨±¾´óÌâ¹²4СÌ⣬ÿСÌâ8·Ö£¬¹²32 ·Ö£© ÇëÔÚ´ðÌâÖ½ÏàÓ¦µÄλÖÃÉÏÌîдÕýÈ·´ð°¸¡£Ð´ÔÚÊÔ¾íÉϲ»µÃ·Ö¡£ 23£® ÒÑÖªÓÐÏòͼÈçͼ1Ëùʾ£º £¨1£©Ð´³ö¶¥µãBµÄ¶È£¨2·Ö£©£» £¨2£©Ð´³ö´Ó½áµãD¿ªÊ¼µÄÁ½¸ö¹ã¶ÈÓÅÏÈËÑË÷ÐòÁУ¨2·Ö£©£» £¨3£©»³ö¸ÃͼµÄÁÚ½Ó±í£¨4·Ö£©¡£ ½â´ð: £¨1£©¶¥µãBµÄ¶È:_______3________ (2·Ö) £¨2£©_________DBCA______ºÍ_____DCBA______ (2·Ö) £¨3£©(4·Ö) A B C ͼ 1 D »ò 24. ÒÑÖª¶þ²æÊ÷µÄÖÐÐòÐòÁÐΪDBGEAFC£¬ºóÐòÐòÁÐΪDGEBFCA£¬»³ö¶ÔÓ¦µÄ¶þ²æÊ÷¡£ ½â´ð: A / \\ B C / \\ / D E F / G 25. ͼ2±íʾһ¸öµØÇøµÄͨѶÍø£¬±ß±íʾ³ÇÊмäµÄͨѶÏß·£¬±ßÉϵÄȨֵ±íʾ¼ÜÉèÏß·»¨·ÑµÄ´ú¼Û£¬Ç뻳ö¸ÃͼµÄ×îС´ú¼ÛÖ§³ÅÊ÷£¬²¢¼ÆËã×îС´ú¼ÛÖ§³ÅÊ÷µÄȨ¡£ ͼ2 ½â´ð: £¨Ã¿Ìõ±ß1·Ö£¬»·½¿òµÄÁ½Ìõ±ßÈÎÑ¡Ò»Ìõ£© ×îС´ú¼ÛÖ§³ÅÊ÷µÄȨ=56 £¨3·Ö£© 26. ÉèÒ»¸ö±ÕÉ¢Áбí¾ßÓÐ10¸öÍ°£¬É¢Áк¯ÊýH£¨x£©=x%7£¬ÈôÔªËØÊäÈë˳ÐòΪ£º {50£¬42£¬85£¬22£¬76£¬19£¬34£¬68}£¬½â¾ö³åÍ»ÓÃÏßÐÔÖØÐÂÉ¢Áм¼Êõ£¬ÒªÇó»³ö¹¹ÔìºÃµÄÉ¢ÁÐ±í¡£ ½â´ð:£¨8·Ö£¬µÚ¶þÐÐÿ¸öÊý×Ö1·Ö£© 0 42 1 50 2 85 3 22 4 5 19 6 76 7 34 8 68 9 ËÄ¡¢Ëã·¨Éè¼Æ£¨±¾´óÌâ¹²2СÌ⣬µÚ27СÌâ10·Ö£¬µÚ28СÌâ12·Ö£¬¹²22 ·Ö£© ÇëÔÚ´ðÌâÖ½ÏàÓ¦µÄλÖÃÉÏÌîдÕýÈ·´ð°¸¡£Ð´ÔÚÊÔ¾íÉϲ»µÃ·Ö¡£ 27.¶þ²æËÑË÷Ê÷TÓöþ²æÁ´±í´æ´¢½á¹¹±íʾ£¬ÆäÖи÷ÔªËصÄÖµ¾ù²»Ïàͬ¡£±àдËã ·¨£¬°´µÝ¼õ˳Ðò´òÓ¡TÖи÷ÔªËصÄÖµ¡£½áµã½á¹¹¶¨ÒåÈçÏ£º typedef int TreeItem; typedef struct btnode *btlink; typedef struct btnode{ TreeItem data; btlink left, right; }BTNODE; ½â´ð: void f(btlink t) { // »òvoid f(BTNODE *t) if(t){ f(t->right); printf(\ f(t->left); } } 28. ÔĶÁÏÂÃæ³ÌÐò£¬Æ书ÄÜÊǵ÷ÕûÏßÐÔ±íÖеÄÔªËØ£¬½«ËùÓÐÆæÊý·ÅÔÚ±íµÄ×ó±ß£¬½«ËùÓÐżÊý·ÅÔÚ±íµÄÓұߡ£ÇëÌî¿ÕÍê³É¸Ã³ÌÐò¡££¨Ã¿¿Õ1·Ö£¬¹²12 ·Ö£© #define MAXSIZE 100 typedef int ElemType; typedef struct{ ElemType elem[MAXSIZE]; int last; /*Ä©ÔªËØϱê*/ }SeqList; void AdjustSqlist(SeqList *L){ ElemType temp; int i=0, j= ¢Å ; while(i while(L->elem[ ¢Æ ]%2 != 0 && ¢Ç ) i++; while(L->elem[ ¢È ]%2 = = 0 && ¢É ) j--; if( ¢Ê )break; temp = L->elem[i]; } } L->elem[i]= ¢Ë ; L->elem[j]= ¢Ì ; void main(){ SeqList ¢Í ; int r, i; } ½â´ð:£¨Ã¿¿Õ1·Ö£¬¹²12·Ö£¬´óСд²»ÄÜ´í£© ¢Å¡¢_______ L->last _____________ ¢Ç¡¢_______ i ¢Æ¡¢_______ i ______________________ ¢È¡¢_______ j ______________________ ¢Ê¡¢_______ i>=j ___________________ ¢Ì¡¢______ temp __________________ ¢Î¡¢_______SeqList *_____________ ¢Ð¡¢_______sq->elem[i]____________ sq=( ¢Î )malloc(sizeof(SeqList)); printf(\ÇëÊäÈëÏßÐÔ±íµÄ³¤¶È:\scanf(\ sq->last = ¢Ï ; printf(\ÇëÊäÈëÏßÐÔ±íµÄ¸÷ÔªËØÖµ:\\n\ for(i=0; i<=sq->last; i++) scanf(\ ¢Ð ); AdjustSqlist(sq); 08רÉý±¾Êý¾Ý½á¹¹¿¼Ìâ½â´ð Ò»¡¢ µ¥ÏîÑ¡ÔñÌ⣨¹²12СÌ⣬ÿСÌâ2 ·Ö£¬¹²24·Ö£© 1£®Ó÷ǵݹ鷽·¨ÊµÏֵݹéË㷨ʱͨ³£ÒªÊ¹Óà A£®Ñ»·¶ÓÁÐ B£®Õ» C£®¶þ²æÊ÷ D£®Ë«Ïò¶ÓÁÐ 2£®¶ÔÓÚÒ»¸ö¾ßÓÐn¸ö¶¥µãºÍeÌõ»¡µÄ¸³È¨ÓÐÏòͼ£¬Èç¹ûÓø³È¨ÁÚ½Ó¾ØÕó±íʾÕâ¸öͼ£¬ÇëÎÊÇóµ¥Ô´×î¶Ì·¾¶µÄDijkstraËã·¨µÄʱ¼ä¸´ÔÓ¶ÈΪ A£®O(n) B£®O(n+e) 3£®ÉèÓï¾äx++µÄÖ´ÐÐʱ¼äʱµ¥Î»Ê±¼ä£¬ÒÔÏÂÓï¾äµÄʱ¼ä¸´ÔÓ¶ÈÊÇ for(i=1; i<=n; i++) for(j=1; j<=n; j++) x++; C£®O(n*n*n) D£®O(n*n) C£®O(n*n) D£®O(2e) A£®O(1) B£®O(n) 4£®Ò»¸ß¶ÈΪhµÄ·Ç¿Õ¶þ²æÊ÷£¨¼ÙÉèÖ»º¬¸ù½ÚµãµÄÊ÷µÄ¸ß¶ÈΪ1£©×î¶àÓм¸¸ö½Úµã A£®2h 5£®¸³È¨ÓÐÏòͼGÓÃÓø³È¨ÁÚ½Ó¾ØÕóA´æ´¢£¬Ôò½ÚµãiµÄÈë¶ÈµÈÓÚ A£®µÚiÐзǡ޵ÄÔªËØÖ®ºÍ B£®µÚiÁзǡ޵ÄÔªËØÖ®ºÍ D£®µÚiÁзǡÞÇÒ·Ç0µÄÔªËظöÊý B£®2h-1 C£®2h-1 D£®2h C£®µÚiÐзǡÞÇÒ·Ç0µÄÔªËظöÊý 6£®ÉèË«Á´±íµÄ½ÚµãÀàÐͶ¨ÒåÈçÏ£¬ typedef typedef struct node *link; struct node{ ListItem element; link left; link right; }*p,*q,*r; ɾ³ýË«Á´±íÖнڵãp(ÓÉpÖ¸ÏòµÄ½Úµã)µÄ²Ù×÷ÊÇ ÕýÈ·µÄ×ö·¨ÈçÏÂͼ£º A£® q=p->left; r=p->right; q->right=r; r->left=q; ÕýÈ·µÄ B£® q=p->right; r=p->left; q->right=r; r->left=q; °ÑAµÄpºÍq·´¹ýÀ´£¬½á¹û´íÁË¡£ C£® q=p->left; r=p->right; q->left=r; r->right=q; ´íÎó£¬ÓëBÒ»Ñù£¬Ö»ÊÇ°ÑpºÍq·´¹ýÀ´¡£ D£®q=p->left; r=p->right; q->right=r->left; ʲôҲûÓб仯¡£ 7£®»áÒýÆðÑ»·¶ÓÁжÓͷλÖ÷¢Éú±ä»¯µÄ²Ù×÷ÊÇ A£®³ö¶ÓÁÐ 8£®Èçͼ1Ëùʾ£¬Èô´Ó¶¥µã1³ö·¢½øÐйã¶ÈÓÅÏÈËÑË÷£¬ÔòµÃµ½µÄ·ÃÎÊÐòÁÐÊÇ A£® 1,8,3,4,5,6,7,2 B£® 1,2,3,7,5,6,4,8 C£® 1,2,5,4,3,6,7,8 D£®1,2,3,4,5,6,7,8 9£®ÏÂÁÐÅÅÐòËã·¨ÖУ¬²»ÊÜÊý¾Ý³õʼ״̬ӰÏ죬ʱ¼ä¸´ÔÓ¶ÈΪO(n*logn)µÄÊÇ A£®¶ÑÅÅÐò 10£®ÓÃÖ¸ÕëʵÏÖ¶þ²æÊ÷£¬ÔÚn¸ö½ÚµãµÄ¶þ²æÊ÷Öк¬ÓжàÉÙ¸ö¿ÕÖ¸Õ룿 A£®n 11£®ÓÃÒ»¿Ã¶þ²æËÑË÷Ê÷½øÐÐ( )µÃµ½µÄÊÇÓÐÐòÐòÁС£ A£®Ç°Ðò±éÀú 12£®ºÏ²¢ÅÅÐòËã·¨µÄʱ¼ä¸´ÔÓ¶ÈÊÇ A£®O(n2) ¶þ¡¢ Ìî¿ÕÌ⣨¹²7СÌ⣬ÿ¿Õ2 ·Ö£¬¹²16·Ö£© 13£®ÔÚÒ»¸ö³¤¶ÈΪnµÄ˳Ðò±íµÄµÚi£¨1<=i<=n£©¸öÔªËØ֮ǰ²åÈëÒ»¸öÔªËØ£¬ÐèÒª B£®O(nlogn) C£®O(logn) D£®O(n) B£®ÖÐÐò±éÀú C£®ºóÐò±éÀú D£®²ã´Î±éÀú B£®n-1 C£®n+1 D£®2n B£®Ã°ÅÝÅÅÐò C£®Ö±½ÓÑ¡ÔñÅÅÐò D£®¿ìËÙÅÅÐò B£®Èë¶ÓÁÐ C£®È¡¶ÓÊ×ÔªËØ D£®È¡¶ÓβԪËØ ºóÒÆ___n-i+1____¸öÔªËØ¡£ 14£®Éèij¹þ·òÂüÊ÷ÓÐn¸öÒ¶×ӽڵ㣬Ôò¸Ã¹þ·òÂüÊ÷µÄ×ܽáµãÊýΪ__2n-1__¡£ 15£®ÉèÓÐÒ»¸öÐòÁÐ8,53,37,28£¬µ±Ê¹ÓÃÖ±½Ó²åÈëÅÅÐò´ÓСµ½´óÅÅÐòʱ£¬±È½Ï´ÎÊýÊÇ____5____¡£ 16£®ÉèSQΪѻ·¶ÓÁУ¬´æ´¢ÔÚÊý×équeue[0¡m-1]ÖУ¬ÔòSQÈë¶Ó²Ù×÷¶ÔÆä¶ÓβָÕërearµÄÐÞ¸ÄÊÇ___ (rear+1)%m___¡£ 17£®Éè´ýÅÅÐòµÄÐòÁÐÖдæÔÚ¶à¸ö¼Ç¼¾ßÓÐÏàͬµÄ¼üÖµ£¬¾¹ýÅÅÐò£¬ÕâЩ¼Ç¼µÄÏà¶Ô´ÎÐòÈÔÈ»±£³Ö²»±ä£¬Ôò³ÆÕâÖÖÅÅÐòÊÇ__Îȶ¨µÄ____£¬·ñÔò³ÆΪ___²»Îȶ¨µÄ___¡£ 18£®ÔÚÒ»¸ö¾ßÓÐn¸ö¶¥µãµÄÎÞÏòͼÖУ¬ÒªÁ¬Í¨ËùÓеĶ¥µãÖÁÉÙÐèÒª__n-1____Ìõ±ß¡£ 19£®ÔÚÓÐÏòͼÖУ¬ÒÔ¶¥µãvΪÆðµãµÄ»¡µÄÊýÄ¿³ÆΪvµÄ___³ö¶È__¡£ Èý¡¢ Ó¦ÓÃÌ⣨¹²4СÌ⣬ÿСÌâ10 ·Ö£¬¹²40·Ö£© 20£®ÒÑÖª¹Ø¼ü×ÖÐòÁÐ(12,77,21,65,38,7,40,53)£¬²ÉÓÃÖ±½Ó²åÈëÅÅÐò°´µÝÔöÅÅÐò£¬¸ø³öÿһÌ˵Ľá¹û¡£ 12,77,21,65,38,7,40,53 12,21,77,65,38,7,40,53 12, 21,65, 77,38,7,40,53 12, 21, 38,65, 77, 7,40,53 7,12, 21, 38,65, 77, 40,53 7,12, 21, 38,40,65, 77, 53 7,12, 21, 38,40,53,65, 77 21£®ÒÑ֪ɢÁÐ±í³¤¶ÈΪ10£¨É¢Áпռä0..9£©£¬Ê¹ÓÃÏßÐÔÖØÐÂÉ¢Áм¼Êõ½â¾ö³åÍ»£¬ ÏÖÓÐÒ»×éµ¥´Ê(SUN, MON, TUE , WED , THU, FRI, SAT)£¬Æä¶ÔÓ¦µÄÉ¢Áк¯ÊýÖµ·Ö±ðΪ(3,2,6,3,2,5,6)£¬Ç뻳öÕâ×éµ¥´Ê²åÈëºóµÄÉ¢ÁÐ±í¡£ 0 1 2 MON 3 SUN 4 WED 5 THU 6 TUE 7 FRI 8 SAT 9 22£®¼ÙÉèÒ»¸ö¶þ²æÊ÷µÄÏÈÐòΪEBADCFHGIKJ£¬ÖÐÐòÐòÁÐÊÇABCDEFGHIJK£¬ £¨1£© »³ö¶þ²æÊ÷£»£¨2£©Ð´³öºóÐòÐòÁС£ ÏÈÐòΪEBADCFHGIKJ£¬ÖÐÐòÐòÁÐÊÇABCDEFGHIJK£¬¸ùÊÇE E / \\ ABCD FGHIJK ÖÐ BADC FHGIKJ ÏÈÐò ¸ùB ¸ùF / \\ / \\ A CD GHIJK ÖÐ A DC HGIKJ ÏÈÐò ¸ùD ¸ùH / / \\ C G IJK ÖÐ IKJ ÏÈ ¸ùI \\ JKÖÐ KJÏÈ ¸ùK / J ×îºó½á¹û£º E / \\ B F / \\ \\ A D H / / \\ C G I \\ K / J ºóÐòÊÇ£ºA C D B G J K I H F E 23£®¸ù¾ÝPRIMËã·¨»³öͼ2µÄ×îСÉú³ÉÊ÷£¬ÒªÇó»³ö´Ó¶¥µã1¿ªÊ¼Éú³ÉµÄ¹ý³Ì¡£ ½â´ð£º ËÄ¡¢ Ëã·¨Éè¼ÆÌ⣨¹²2СÌ⣬ÿСÌâ10 ·Ö£¬¹²20·Ö£© 24£®ÏÂÁгÌÐò½«¼¯ºÏAºÍ¼¯ºÏB¹é²¢³ÉÒ»¸ö¼¯ºÏC£¬¹é²¢Ç°¼¯ºÏAºÍ¼¯ºÏBÖеÄÔªËØ°´·ÇµÝ¼õÅÅÁУ¬¹é²¢ºó¼¯ºÏCµÄÔªËØÈÔ°´·ÇµÝ¼õ˳ÐòÅÅÁУ¬¶øÇÒC²»Ðè Ҫн¨½Úµã¿Õ¼ä¡£ÇëÍêÉƳÌÐò¡£ typedef struct node{ ElemType data; struct node * next; }*LinkList ˵Ã÷£º*LinkListÊÇÖ¸ÕëÀàÐÍ£¬»ùÀàÐÍÊÇLNode¡£ void MergeSet(LinkList La, LinkList Lb){ LinkList pa , pb, pc , p; pa=La; pb=Lb; pc=NULL; while(_____pa!=NULL&& pb!=NULL __________){ if(pa->data<=pb->data){ if(pc!=NULL) { ______p->next=pa;________________ p=p->next; } else{ pc=pa; p=pc; }//if _____pa=pa->next_______________; } else{ if(pc!=NULL) { ____p->next=pb;_______________ p=p->next; } else{ pc=pb; p=pc; }//if ____pb=pb->next_____________; }//if }//while p->next=(pa!=NULL)?pa:pb; /*´¦ÀíÒ»¸öÁ´±íΪ¿ÕµÄÇé¿ö*/ } 25£®¶þ²æÅÅÐò£¨ËÑË÷£©Ê÷tÒÔ¶þ²æ±íΪ´æ´¢½á¹¹£¬Çë±àдË㷨ʵÏÖÔÚ¸ÃÊ÷ÉϲéÕÒֵΪxµÄ½Úµã¡£ typedef int TreeItem; typedef struct btnode *btlink; typedef struct btnode{ TreeItem data; Btlink lchild, rchild; /*×óÓÒº¢×ÓÖ¸Õë*/ }BiTNode Ëã·¨º¯ÊýÔÐÍBiTNode Locate(BiTNode *t, TreeItem x) ½â´ð£º BiTNode Locate(BiTNode *t, TreeItem x){ if(t = =NULL)return NULL: if( x = = t-> data ) return *t; /* ×¢Òâ*£¬ÒòΪ·µ»ØÀàÐÍÊÇBiTNode*/ else if( x < t-> data ) return Locate(t->lchild, x); /*×ó×ÓÊ÷*/ else return Locate(t->rchild, x); /*ÓÒ×ÓÊ÷*/ } 09ÄêרÉý±¾Êý¾Ý½á¹¹¿¼Ìâ½â´ð(¹²100·Ö) Ò»¡¢ µ¥ÏîÑ¡ÔñÌ⣨12СÌ⣬ÿСÌâ2·Ö£¬¹²24·Ö£© 1¡¢Òª±íʾ¸ßУУ¡¢Ïµ¡¢°à¼¶µÄÓйØÊý¾Ý¼°Æä¹Øϵ£¬Ñ¡Ôñ______±È½ÏºÏÊÊ¡£ A. ÏßÐԽṹ B. Ê÷½á¹¹ C. ͼ½á¹¹ D.¼¯ºÏ½á¹¹ 2¡¢ÏÂÁк¯ÊýÖи´ÔÓ¶È×îСµÄÊÇ A. T(n)=nlog2n+5000n B. T(n)=n2-8000n C. T(n)=nlog22n-6000n D. T(n)=2nlog22n-7000n nlog22n= nlog22+log2n=n1+log2n=n*n log2n 3¡¢ÒÑÖªÒ»¸öÕ»sÒÔ¼°Ò»¸öÊäÈëÐòÁÐ(A£¬B£¬C£¬D£¬E)£¬Ã¿¸öÔªËØ°´ÕÕA£¬B£¬C£¬D£¬E˳Ðò½øÕ»Ò»´Î£¬½øÕ»ºó¿ÉÁ¢¼´³öÕ»£¬Ò²¿ÉÔÚÕ»ÖÐÍ£ÁôÒ»¶Îʱ¼äºóÔÙ³öÕ»£¬Ôò²»Äܵõ½£¨£©ÐòÁС£ A£®A¡¢B¡¢C¡¢D¡¢E B. B¡¢A¡¢E¡¢D¡¢C C£®C¡¢B¡¢A¡¢D¡¢E D. D¡¢C¡¢A¡¢B¡¢E 4¡¢Æ½¾ùÅÅÐòЧÂÊ×îºÃµÄÅÅÐò·½·¨ÊÇ£¨£©¡£ A£®Ö±½Ó²åÈëÅÅÐò B£®¿ìËÙÅÅÐò C£®¼òµ¥Ñ¡ÔñÅÅÐò D£®Ã°ÅÝÅÅÐò 5¡¢Ä³Á´±íÖÐ×î³£ÓõIJÙ×÷ÊÇÔÚÒÑÖªµÄÒ»¸ö½áµã֮ǰ²åÈëÒ»¸öнáµãºÍɾ³ýÆä֮ǰһ¸ö½áµã£¬Ôò²ÉÓ㨣©´æ´¢·½Ê½×î½ÚÊ¡ÔËËãʱ¼ä¡£ A£®Ë«ÏòÁ´±í B£®´øÍ·Ö¸ÕëµÄµ¥ÏòÁ´±í C£®´øβָÕëµÄµ¥ÏòÁ´±í D£®µ¥ÏòÑ»·Á´±í 6¡¢ÔÚÂß¼½á¹¹²»±äµÄÇé¿öÏ£¬²»Êǵ¼ÖÂÒ»¸öͼµÄ±éÀúÐòÁв»Î¨Ò»µÄÒòËØÊÇ£¨£©¡£ A£®³ö·¢µã²»Í¬ B£®´æ´¢(ÎïÀí)½á¹¹²»Í¬ C£®±éÀú·½·¨²»Í¬ D£®»·¨²»Í¬ 7¡¢É¢Áк¯ÊýÓÐÒ»¸ö¹²Í¬µÄÒªÇ󣬼´º¯ÊýÖµÓ¦µ±¾¡Á¿ÒÔ£¨£©È¡ÆäÖµÓòµÄÿ¸öÖµ¡£ A£®×î´ó¸ÅÂÊ B£®×îС¸ÅÂÊ C£®Õý̬·Ö²¼¸ÅÂÊ D£®¾ùµÈ¸ÅÂÊ 8¡¢ÏÂÃ棨£©·½·¨¿ÉÒÔÅжϳöÒ»¸öͼÖÐÊÇ·ñ´æÔÚ»·(»Ø·)¡£ A£®ÅÅÐò B£®Éî¶ÈºÍ¹ã¶È±éÀú C£®Çó×î¶Ì·¾¶ D£®Çó¹Ø¼ü·¾¶ 9£®×î¼Ñ¶þ²æËÑË÷(ÅÅÐò)Ê÷ÊÇ£¨£©¡£ A£®¹Ø¼üÂë¸öÊý×îСµÄ¶þ²æËÑË÷Ê÷ B£®ÍË»¯ÎªÏßÐԵĶþ²æËÑË÷Ê÷ £¬ C£®ËÑË÷ÖÐƽ¾ù±È½Ï´ÎÊý×îСµÄ¶þ²æËÑË÷Ê÷ D£®ÈκνáµãµÄ¶ÈÊýΪ0»ò2µÄ¶þ²æËÑË÷Ê÷ 10£®£¨£©ÊÇÊý¾ÝµÄ»ù±¾µ¥Î»£¬¼´Êý¾Ý¼¯ºÏ(¶ÔÏó)ÖеĸöÌå¡£ A£®Êý¾Ý½á¹¹ B£®Êý¾ÝÏî C£®Êý¾ÝÔªËØ D£®Êý¾Ý¶ÔÏó 11£® (ÏßÐÔ)±íÊÇÒ»¸ö£¨£©¡£ A£®ÓÐÏÞÐòÁУ¬¿ÉÒÔΪ¿Õ B£®ÓÐÏÞÐòÁУ¬²»ÄÜΪ¿Õ C£®ÎÞÏÞÐòÁУ¬¿ÉÒÔΪ¿Õ D£®ÎÞÏÞÐòÁУ¬²»ÄÜΪ¿Õ 12£®Ê÷ÊǽáµãµÄ¼¯ºÏ£¬Ëü£¨£©¸ù½áµã¡£ A£®ÓÐ0¸ö»ò1¸ö B£®ÓÐ0¸ö»ò¶à¸ö C£®ÓÐÇÒÖ»ÓÐ1¸ö D£®ÓÐ1¸ö»ò1¸öÒÔÉÏ ¶þ¡¢Ìî¿ÕÌâ(±¾´óÌâ¹²7СÌ⣬ÿ¿Õ2·Ö£¬¹²16·Ö) Ç뽫´ð°¸Ð´ÔÚ´ðÌâÖ½ÏàÓ¦µÄλÖÃÉÏ¡£ 13£® ÔÚÓÐn¸ö¶¥µãµÄÓÐÏòͼÖУ¬Ã¿¸ö¶¥µãµÄ¶È(=Èë¶È+³ö¶È)×î´ó¿É´ï£¨2n-2£©¡£ 14£® ÒÔϳÌÐò¶ÎµÄʱ¼ä¸´ÔÓ¶ÈÊÇ£¨£©¡£ i=0£» j=0; while ( i+j<=n) { if(i>j)j++; else i++£» } ÿ´ÎÖ»×öi++»òj++£¬²»»áͬʱ i++¶øÇÒj++£¬ nµÄÖµ²»±ä£¬Òò´ËÑ»·n´Î£¬¸´ÔÓ¶ÈO(n) 15£® ÓÒͼËùʾµÄ¶þ²æÊ÷ºóÐò±éÀúµÄ½á¹ûÊÇ£¨EDCBIHJGFA£©¡£ 16£® ÔÚÒ»¸öË«ÏòÁ´±íÖÐpËùÖ¸½áµã֮ǰ²åÈëÒ»¸öÓÉÖ¸ÕësËùÖ¸µÄнáµã£¬Ð´³ö¿ÉÖ´ÐеIJÙ×÷ÐòÁУº£¨£©¡£(Ç°Ö¸ºÍºóÖ¸µÄÖ¸ÕëÓò·Ö±ðΪpriorºÍnext) 1. s->prior=p->prior£» 2. s->next=p£» 1ºÍ2˳Ðò¿É»» 3. p->prior->next=s£» 4. p->prior=s£» ×¢Òâp->priorÒª×îºó¸Ä±ä£¬ÒòΪ֮ǰҪÓà 17. (ÏßÐÔ)±íÓÐÁ½ÖÖ´æ´¢½á¹¹£ºË³Ðò´æ´¢½á¹¹ºÍÁ´Ê½´æ´¢½á¹¹£¬Çë¾ÍÕâÁ½ÖÖ´æ´¢½á¹¹Íê³ÉÏÂÁÐÌî³ä£º£¨Ë³Ðò´æ´¢½á¹¹£©´æ´¢ÃܶȽϴ󣬿ÉÒÔËæ»ú´æÈ¡£º£¨Á´Ê½´æ´¢½á¹¹£©²»¿ÉÒÔËæ»ú´æÈ¡£¬²åÈëºÍɾ³ý²Ù×÷±È½Ï·½±ã¡£ 18£®µÝ¹éµÄ³ÌÐòÖ´ÐÐʱʹÓ㨶ÑÕ»£©À´±£´æ¸÷²ãµÝ¹éµ÷ÓÃʱµÄÏÖ³¡ÐÅÏ¢£¬ÒÔ±£Ö¤¿ÉÒÔÕýÈ··µ»Ø¡£ 19£®ÉèÊý×éa[M](MΪ×î´ó¿Õ¼ä¸öÊý)×÷Ϊѻ·¶ÓÁÐQµÄ´æ´¢¿Õ¼ä£¬frontΪ¶ÓÍ·Ö¸Õë(Ö¸ÏòµÚÒ»¸ö´æ·ÅÊý¾ÝµÄλÖÃ)£¬rearΪ¶ÓβָÕë(Ö¸Ïò×îºóÒ»¸ö´æ·ÅÊý¾ÝλÖõÄÏÂÒ»¸ö)£¬ÔòÅж¨Q¶ÓÁеĶÓÂúÌõ¼þÊÇ£¨£©¡£ ¶ÓÂúÌõ¼þÓë·½°¸Î޹أ¬×ÜÊÇ(rear+1)%n==front Èý¡¢Ó¦ÓÃÌâ(±¾´óÌâ¹²4СÌ⣬ÿСÌâ10·Ö£¬¹²40·Ö) Ç뽫´ð°¸Ð´ÔÚ´ðÌâÖ½ÏàÓ¦µÄλÖÃÉÏ¡£ 20£®Éè×Ö·û¼¯D={A£¬B£¬C£¬D£¬E}£¬¸÷×Ö·ûʹÓÃƵÂÊW={10£¬2£¬5£¬6£¬4}£¬»³ö¶Ô×Ö·û½øÐйþ·òÂü±àÂëʱËù¶ÔÓ¦µÄ¹þ·òÂüÊ÷£¬²¢¸ø³ö¸÷×Ö·ûµÄ±àÂë¡£ 21£®ÓÃÆÕÀïÄ·(Prim)Ëã·¨´ÓÓÒͼÖеĶ¥µã1¿ªÊ¼Öð²½¹¹Ôì×îС֧³Å(´ú¼ÛÉú³É)Ê÷£¬ÒªÇó»³ö¹¹ÔìµÄÿһ²½¡£ 22£®¸ø¶¨´ýÅŹؼü×Ö¼¯ºÏΪ{23£¬14£¬48£¬25£¬5£¬19}£¬°´¹Ø¼ü×ַǵݼõ(´ÓСµ½´ó)ÅÅÐò£¬Ð´³ö²ÉÓÃðÅÝÅÅÐòµÄÿһÌË(×îÍâ²ãÑ»·µÄÿһ´Î)ÅÅÐò½á¹û¡£ 23£®(1)ͼʾ±íʾÓÒ±ßÓÐÏòͼµÄÁÚ½Ó±í¡£(4·Ö) (2)д³ö´Ó¶¥µã1¿ªÊ¼·Ö±ð½øÐÐÉî¶ÈÓÅÏȺ͹ã¶ÈÓÅÏȱéÀúµÄ¶¥µãÐòÁи÷Ò»ÖÖ¡£(6·Ö) ËÄ¡¢Ëã·¨Éè¼ÆÌâ(±¾´óÌâ¹²2СÌ⣬ÿСÌâ10·Ö£¬¹²20·Ö) Ç뽫´ð°¸Ð´ÔÚ´ðÌâÖ½ÏàÓ¦µÄλÖÃÉÏ¡£ 24£®¼Ù¶¨ÓÃÒ»¸öÓÐÍ·½áµãÑ»·Á´±íÀ´´æ´¢Ò»¸öÓÐÐòµÄÏßÐÔ±í£¬ÏßÐÔ±í´ÓÍ·µ½Î² Ϊ·ÇµÝ¼õ(´ÓСµ½´ó)ÓÐÐò(ÈçÏÂͼ)¡£ÓÃÖ¸Õëcurrent´Óhead¿ªÊ¼ËÑË÷Êý¾ÝÓòµÈÓÚkeyµÄÔªËØÔÚÏßÐÔ±íÖÐλÖã¬Èç¹ûËÑË÷³É¹¦ÔòcurrentÖ¸ÏòËÑË÷µ½µÄ½áµã£¬º¯Êý·µ»Ø¸ÃÖ¸Õ룺Èç¹ûËÑË÷²»³É¹¦£¬º¯Êý·µ»Ø¿ÕÖ¸ÕëNULL¡£ÇëÔÚº¯Êý SortedlistLocate(head£¬key) ÄÚÌî¿Õ£¬Íê³ÉÏÂÁÐËã·¨ÒÔʵÏÖÕâÖÖËÑË÷£¬²¢Ê¹µÃËÑË÷²»³É¹¦µÄƽ¾ù±È½Ï´ÎÊýСÓÚÁ´±í³¤¶È¡££¨·¢ÏÖcurrentÖ¸Ïò½áµãµÄÊý¾ÝÓò±Èkey´ó£¬ÔòÍ£Ö¹ËÑË÷£¬ºóÃæ¿Ï¶¨Ã»ÓÐkey£¬ËÑË÷ʧ°Ü¡£ÕâÑù¾ÍûÓбØÒª×ßµ½Á´±íµÄβ²¿£¬²»³É¹¦µÄƽ¾ù±È½Ï´ÎÊý=(0+1+2+..+n)/(n+1)=n/2£© ×¢Ò⣺ÓÐÍ·½áµã£¬Êǵ¥Ñ»·Á´±í¡£¿Õ±íÈçÏ typedef struct node{ elemtype data£»/*Êý¾ÝÓò*/ struct node next£»/*Ö¸ÕëÓò*/ }lnode£¬*linklist£» ×¢Òâtypedef£¬lnodeºÍlinklistÊÇÀàÐÍÃû linklist SortedlistLocate ( linklist head£¬ elemtype key){ linklist current£» if(_head==NULL_)return ERROR£» /*´íÎóÌáʾ*/ current ___=head->next____; /*ÑÁ´ËÑË÷ÆäÖµµÈÓÚkeyµÄ½áµã*/ while(_current!=head_&&_current->data current=current-->next£» /*Åųý¿Õ±í*/ if ( _ current !=head && current->data==key _) return current£» /*ÕÒµ½£¬·µ»Ø½áµãµØÖ·*/ else return NULL£» /*Ä©ÕÒµ½£¬·µ»Ø¿ÕÖ¸Õë*/ } 25£®r[]ΪһάÊý×飬ÆäÖÐr[0]µ½r[n-1]Ϊ´ýÅÅÐòµÄn¸öÔªËØ£¬ÅÅÐòºÃµÄÔªËØÈÔ·ÅÔÚr[0]µ½r[n-1]ÖС£Çëд³ö¶Ô¸ÃÊý×é½øÐзǵݼõÅÅÐòµÄÖ±½Ó²åÈëÅÅÐòËã·¨£¬ È¡ÃûΪInsertSort(elemtype r[]£¬int n)¡£