·¢²¼Ê±¼ä : ÐÇÆÚÈÕ ÎÄÕÂÊý¾Ý½á¹¹¸´Ï°ÌâÓë´ð°¸¸üÐÂÍê±Ï¿ªÊ¼ÔĶÁ7a1359e459fafab069dc5022aaea998fcc2240c9
.
}
return -1;
} //end of BinarySearch
27 (Ëã·¨Ìî¿Õ)
ÏÂÁк¯ÊýΪ¶ÑÅÅÐòÖеĶѵ÷Õû¹ý³Ì(µ÷ÕûH.r[s]µÄ¹Ø¼ü×Ö£¬Ê¹H.r[s..m]³ÉΪһС¶¥¶Ñ)¡£ÇëÔÚ¡° ¡±´¦ÌîÉϺÏÊʵÄÄÚÈÝ,Íê³É¸ÃËã·¨¡£
Void heapadjust( heaptype @ H , int s , int m ) { rc=H.r[s];
for (j=2*s;j<=m;j*=2) {
if (j
H.R[s] = rc ; }//heapadjust
ͼʾ½á¹¹Ìâ
1 ÒÑÖªÔÚµçÎÄÖÐÖ»³öÏÖƵÂÊΪ ( 5,26,7,23,20,19 )µÄ£¶¸ö×Ö·û£¬ »³öÄ㽨µÄ¹þ·òÂüÊ÷£¬²¢¸ø³öÆä¹þ·òÂü±àÂë¡£
2.ÒÑ֪ij¶þ²æÊ÷µÄºóÐò±éÀúºÍÖÐÐò±éÀú´ÎÐò·Ö±ðΪDBFGECAºÍBDACFEG Ç뻳ö¸Ã¶þ²æÊ÷£¬²¢ÎªÖ®½¨Á¢ÏÈÐòÏßË÷¡£
3 ÒÑ֪ij¶þ²æÊ÷µÄÏÈÐò±éÀú´ÎÐòΪ£ºa,b,c,d,e,f,g.ÖÐÐò±éÀú´ÎÐòΪ£ºb,a,d,f,e,g,c »³ö¸Ã¶þ²æÊ÷£¬²¢Ôڸöþ²æÊ÷ÉϽ¨Á¢ÖÐÐòÏßË÷¡£
4 ij¶þ²æÊ÷µÄÖÐÐò±éÀú´ÎÐòΪBEGFDAC£¬ ÏÈÐò±éÀú´ÎÐòΪABDEFGC¡£ ÊÔ»³ö¸Ã¶þ²æÊ÷£¬²¢ÎªÖ®½¨Á¢ÖÐÐòÏßË÷(ͼʾ֮)¡£
5 ÒÑ֪ij¶þ²æÊ÷µÄºóÐò±éÀúºÍÖÐÐò±éÀú´ÎÐò·Ö±ðΪFBEDGCAºÍFBADECG£¬ Çë¹¹Ôì²¢»³ö¸Ã¶þ²æÊ÷¡£
6 ÉèijһµçÎÄÖ»³öÏÖa,b,c,d,e,f,g 7¸ö×Öĸ£»³öÏÖƵÂÊ·Ö±ðΪ30%,10%,05%,04%,13%,18% ¼°20%£¬Çë¸ø³ö¸÷×ÖĸµÄ¹þ·òÂü±àÂë¡£
7 ½«Í¼Ê¾ÉÁÖת»»Îª¶þ²æÊ÷£¬²¢¶Ô¸Ã¶þ²æÊ÷ÏÈÐòÈ«ÐòÏßË÷»¯¡£
a d h b c e f i j
g k l m
8 ½«Í¼Ê¾ÉÁÖת»»Îª¶þ²æÊ÷£¬²¢¶Ô¸Ã¶þ²æÊ÷ÖÐÐòÈ«ÐòÏßË÷»¯¡£
1 5 6 .
.
2 3 7 8 9
4
9 ij¶þ²æÊ÷µÄ½áµãÊý¾Ý²ÉÓÃ˳Ðò´æ´¢±íʾÈçÏ£º
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
A B C D E F G H I (1)ÊÔ»³ö´Ë¶þ²æÊ÷µÄͼÐαíʾ¡£ (2)½«´Ë¶þ²æÊ÷¿´×÷ÉÁֵĶþ²æÊ÷±íʾ£¬ÊÔ½«Ëü»¹ÔΪÉÁÖ¡£
10 ÒÑ֪ijÓÐÏòͼÈçͼËùʾ£º
1)¸ø³öÆäÊ®×ÖÁ´±í´æ´¢½á¹¹ a 2)¸ø³öÆäÉî¶ÈÓÅÏȱéÀú´ÎÐò¡£ 3)¸ø³öÆä¹ã¶ÈÓÅÏȱéÀú´ÎÐò¡£
b 4)¸ø³ö¸÷Ç¿Á¬Í¨·ÖÁ¿¡£
d
c e 11 ÉèÊäÈëÐòÁÐΪ20,45,30,89,70,38,62,19£¬ÒÀ´Î²åÈëµ½Ò»¿Ã2-3Ê÷ÖÐ(³õʼ״̬Ϊ¿Õ)£¬Ç뻳ö¸ÃB-Ê÷¡£
12 ÓÒͼΪһ¿Ã3½×B£Ê÷¡£ (20£¬25)
1)»³öÔÚ¸ÃÊ÷ÉϲåÈëÔªËØ15 £¯ ©¦ £Ü ºóµÄB£Ê÷¡£ (10£¬14)(21)(35) 2)½Ó×Å£¬ÔÙɾ³ýÔªËØ35£¬»³öɾ³ýºóµÄB£Ê÷¡£
13 ÒÑÖªHashº¯ÊýΪ H(K)=K mod 13 £¬É¢ÁеØַΪ0 --14£¬ÓÃÏßÐÔ̽²âÔÙÉ¢Áд¦Àí ³åÍ»£¬¸ø³ö¹Ø¼ü×Ö(56£¬34£¬68£¬23£¬16£¬70£¬48£¬35£¬83£¬12£¬14£¬57) ÔÚÉ¢ÁеØÖ·µÄ·Ö²¼¡£²¢Ö¸³öƽ¾ù³É¹¦µÄ²éÕÒ³¤¶ÈÊǶàÉÙ?
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
14 ¸ù¾Ý²åÈë´ÎÐò(20£¬30£¬70£¬60£¬10£¬100£¬110£¬90£¬80¡£)½¨Á¢Æ½ºâµÄ¶þ²æÅÅÐòÊ÷¡£ 15 Éè¹þÏ£±í³¤Îª16£¬¹þÏ£º¯ÊýΪH(key)=key mod 13£¬Óÿª·Å¶¨Ö··¨µÄ¶þ´Î̽²âÔÙÉ¢ÁÐ
222222
´¦Àí³åÍ»(di=1£¬-1£¬2£¬-2£¬3£¬-3¡¡)¡£ÒÀ´Î´æÈë12¸öÔªËØ£º56£¬82£¬17,24, 36,21,83,96,13,34,57,50¡£Ç뻳öËüÃÇÔÚ±íÖеķֲ¼ÇéÐΡ£
16 ÒÑÖª´ýÅÅÐòÐòÁÐΪ£º25,12,9,20,7,31,24,35,17,10£¬ÊÔд³ö£º (1). ¶ÑÅÅÐò³õʼ½¨¶Ñ(´ó¶¥¶Ñ)µÄ½á¹û£»
(2). ÒÔµÚÒ»¸öÔªËØΪÊàÖáµÄ¿ìËÙÅÅÐòÒ»ÌËɨÃèµÄ½á¹û£»
.
.
(3). Ï£¶ûÅÅÐòµÚÒ»ÌË(ÔöÁ¿Îª5)µÄ½á¹û¡£
Ëã·¨Éè¼ÆÌâ
1 ÉèÓÐÒ»¸ö´øÍ·½áµã¡¢ÔªËØ°´ÖµµÝÔöÓÐÐòµÄµ¥Á´±í£¬½áµãµÄÀàÐͶ¨ÒåÈçÏ£º typedef struct LNode { int data;
struct LNode *next; } LNode, *LinkList;
±àдËã·¨£¬É¾³ýÆäÖÐËùÓÐÖµÏàͬµÄ¶àÓàÔªËؽáµã
2 ijÏßÐÔ±íÖÐÔªËØÒÔ½µÐòÅÅÁУ¬ÏÖÒª²åÈëÒ»¸öÔªËØX£¬²åÈëºó¸ÃÏßÐÔÔªËØÈÔ±£³Ö½µÐò¡£ÏßÐÔ±í²ÉÓôøÍ·½áµãµ¥Á´±í·½Ê½´æÖü¡£?Çë±àд¸Ã²åÈëËã·¨¡£
3 ±àдÔÚÒ»ÓÐÐò˳Ðò±íÖвåÈëÊý¾ÝÔªËØXµÄËã·¨ INSERT(£Ì£¬£Ø)¡£
4 дһËã·¨£¬Delete(linklist &L£¬X) ,ɾ³ýµ¥Á´±íÖÐËùÓÐֵΪXµÄ½áµã¡£ µ¥Á´±í½áµãµÄÀàÐͶ¨ÒåÈçÏ£º typedef struct LNode { int data;
struct LNode *next; } LNode, *Linklist;
5 дһËã·¨£¬Contrary(linklist &L) ,¶ÔÒ»´øÍ·½áµãÇÒ½öÉèβָÕëLµÄÑ»·µ¥Á´±í¾ÍµØÄæÖá£(¼´±íÍ·±ä±í⣬±íβ±ä±íÍ·¡£) 6 ÒÑÖªÏßÐÔ±íÖеÄÔªËØÒÔÖµµÝÔöÓÐÐòÅÅÁУ¬²¢ÒÔ´øÍ·½áµãµÄµ¥Á´±í×÷´æ´¢½á¹¹¡£ÊÔдһ¸ßЧ µÄËã·¨£¬É¾³ý±íÖÐËùÓÐÖµ´óÓÚminkÇÒСÓÚmaxkµÄÔªËØ(Èô±íÖдæÔÚÕâÑùµÄÔªËØ)ͬʱÊÍ ·Å±»É¾½áµã¿Õ¼ä£¬²¢·ÖÎöÄãµÄËã·¨µÄʱ¼ä¸´ÔӶȡ£ µ¥Á´±í½áµãµÄÀàÐͶ¨ÒåÈçÏ£º typedef struct LNode { int data;
struct LNode *next; } LNode, *Linklist;
7 дһËã·¨£¬½«´øÍ·½áµãµÄÓÐÐòµ¥Á´±íAºÍBºÏ²¢³ÉһеÄÓÐÐò±íC¡£(×¢:²»ÆÆ»µAºÍB µÄÔÓнṹ.)Merge(Linklist A, Linklist B, Linklist &C ) 8 дһËã·¨Oplinklist(linklist L,int i;int j )
ɾ³ýµ¥Á´±íÖеÚi¸öÔªËØ,²¢½«Ö®²åÈëÖÁÔ±íÖеĵÚj¸öÔªËØ֮ǰ. 9 д³öÇóµ¥Á´±í³¤¶ÈËã·¨ int length(linklist L) 10 Èô½«Ñ»·¶ÓÁÐQµÄ½á¹¹¶¨ÒåΪ£º #define m 100 //×î´ó¶ÓÁг¤¶È typedef struct
{ QElemType *base; //´æ´¢¿Õ¼ä»ùÖ·
int rear; //βָÕ룬Èô¶ÓÁв»¿Õ£¬Ö¸Ïò¶ÓβԪËØ int length; //µ±Ç°¶ÓÁеij¤¶È£¬¼´ÔªËظöÊý } SqQueue;
ÊÔд³öÏàÓ¦³õʼ»¯¡¢Èë¶ÓÁкͳö¶ÓÁеÄÈý¸öº¯Êý¡£
.
.
11¶þ²æÊ÷Óöþ²æÁ´±í´æ´¢±íʾ¡£ typedef struct BiTNode { TelemType data;
Struct BiTNode *lchild, *rchild; } BiTNode, *BiTree;
ÊÔ±àдÏú»Ù¶þ²æÊ÷TµÄËã·¨DestroyBiTree ( BiTree &T)¡£
12¶þ²æÊ÷Óöþ²æÁ´±í´æ´¢±íʾ¡£ typedef struct BiTNode { TelemType data;
Struct BiTNode *lchild, *rchild; } BiTNode, *BiTree;
ÊÔ±àдËã·¨£¬ÇóÔªËØֵΪxµÄ½áµãµÄ×óº¢×Ó(·µ»ØxµÄ×óº¢×ÓµÄÖ¸Õë)¡£ 13 Éè¼ÆÒ»Ëã·¨£¬¼ÆËã¸ø¶¨¶þ²æÊ÷TÖжÈΪ2µÄ½áµã¸öÊý¡£ 14±àÒ»Ëã·¨£º°´²ãÐò±éÀú¶þ²æÊ÷T¡£
15ÊÔ±àдÏÈÐò±éÀú¶þ²æÊ÷TµÄµÝ¹éËã·¨PreorderBiTree ( BiTree &T)¡£ 16 д³öÒ»¸ö½«Ê÷ÖÐÿ¸ö½áµãµÄ×óÓÒº¢×Ó¶Ô»»µÄËã·¨ SWAPTREE(T) ¼´Èç:
Ô¶þ²æÊ÷ ת»»ºó T SWAPTREE(T) ¡ý ¡ý
(A) (A)
/ \\ / \\ (B) (C) (C) (B) / \\ / \\ / \\ (D) (E) (F) (F) (E) (D) \\ \\ / /
(G) (H) (H) (G)
17 ¶þ²æÊ÷Óöþ²æÁ´±í´æ´¢±íʾ¡£
ÊÔ±àдºóÐò±éÀú¶þ²æÊ÷TµÄµÝ¹éËã·¨PostorderBiTree ( BiTree T)¡£ 18 дһ¸ö¼ÆËã¶þ²æÊ÷ÖÐÒ¶×Ó½áµã¸öÊýµÄµÝ¹éËã·¨¡£
.