1、2 3 4 5 6 7 8 9 15 16 24 25 2.1-1 2.1-22.1-3 2.1-4 2.2-1 2.2-22.2-3 2.2-4 2.3-1 2.3-2 void Merge(int *A,int p,int q,int r) /int n1=q-p+1; int n2=r-q; int *L=new intn1; int *R=new intn2; for (int i=0;in1;i+) Li=Ap+i-1; for(int j=0;jn2;j+) Rj=Aq+j; int i=0; int j=0; int k=p-1; while(i=n1-1) i+; else A
2、k=Rj; j+; k+; while(i=n1-1) Ak=Li; i+; k+; while(j=n2-1) Ak=Rj; j+; k+; deleteL; delete R; 2.3-32.3-4 2.3-52.3-6 2.3-73 3.1-1 3.1-2 3.1-3 3.1-43.1-5 3.1-6 3.1-7 3.1-8 3.2-1 3.2-23.2-3 3.2-4 3.2-5 3.2-6 3.2-74 4.1-1 4.1-2 4.1-3 T(n)=cnlgn+n 4.1-44.1-54.1-6 4.2-14.2-2 4.2-3 4.2-44.2-54.3-1 4.3-2 4.3-3
3、 4.3-4 4.3-55 5.1-1 5.2-1 5.2-25.2-3 5.2-4 5.2-55.3-15.3-2 5.3-3 5.3-45.3-5 , 3 mn n m (,)*(1)*(1) Pmnmmmn (,)/ n Pmnm (,)/11/ n Pmnmn (,)/()/ nn Pmnmmnm ( )/11/ n mnmn 5.3-6 (,)*(1)*(1) (,)*(1)*(1) (,)*(1)*(1) (,)*(1)*(1) (,)*(1)*(1) (,)*(1)*(1) (,)*(1)*(1) (,)*(1)*(1) (,)*(1)*(1) (,)*(1)*(1) Pmnm6
4、 6.1-1 6.1-2 6.1-3 6.1-4 6.1-5 6.1-6 6.1-7 6.2-1 6-2 6.2-2 6.2-3 6.2-4 6.2-5 i 6.2-6 6.3-16-3 6.3-2 6.3-36.4-1 6-4 6.4-2 HEAPSORT MAX-HEAP 6.4-3 6.4-4 6.4-5 6.5-1 6-5 6.5-2 MAX-HEAP6.5-3 6.5-4 6.5-5 6.5-6 6.5-76.5-87.1-1 7-1 7.1-2 7.1-3 7.1-4 7.2-1 7.2-2 7.2-3 7.2-4 7.2-5 7.2-6 7.3-17.3-2 7.4-1 7.4-
5、2 7.4-3 7.4-4 RANDOMIZED-QUICKSORT.ppt 7.4-5 (7.4-5).pdf 7.4-6 ICKSORT.ppt (7.4-5).pdf8.1-1 8.1-2 8.1-3 8.1-48.2-1 8-2 8.2-2 8.2-3 8.2-4 8.3-1 8-3 8.3-28.3-3 8.3-48.3-5(*) 8.4-1 8-4 8.4-2 8.4-3 3/2 1/2 8.4-4(*) 8.4-5(*) 9.1-1 9.1-2 9.2-1 9.3-1 9.3-2 9.3-39.3-4 9.3-5 9.3-6 9.3-79.3-89.3-915 15.1-1 15
6、.1-2 15.1-3 2 1 11 1 ()2(2)2(21)21 nn njnn i ij j fjrij 15.1-4 15.1-5 nn nn ()2(2)2(21)21 ()2(2)2(21)21 fjrij ()2(2)2(21)21 ()2(2)2(21)21 ()2(2)2(21)2115.2-1 (A 1 A 2 )(A 3 A 4 )(A 5 A 6 ) 15.2-2 15.2-3 15.2-4 15.2-5 15.3-1 15.3-2 15.3-3 15.3-4 15.3-5 15.4-1 15.4-2 15.4-3 15.4-4 15.4-5 15.4-6 #inclu
7、de using namespace std; int find(int *a,int len,int n)/ x ax=n int left=0,right=len,mid=(left+right)/2; while(leftamid) left=mid+1; else if(nn) for(i=0;iai; b0=1; c0=-1; c1=a0; len=1;/ c1 1. for(i=1;ilen)/ len, j len 1len=j;/ lenint n,a100,c100,i,j,len;/ coutlenendl; return 0; 15.5-1 15.5-2 15.5-3 1
8、5.5-4 16 16.1-1 16.1-2 16.1-3 16.1-4 16.2-1 16.2-2 16.2-3 16.2-4 16.2-5 16.2-6 16.2-7 16.3-1 16.3-2 16.3-3 16.3-4 16.3-5 16.3-6 16.3 16.3-7 16.3-8 24 24.1-1 s 24-4 24.1-2 24.1-3 24.1-4 24.1-5* 24.1-6 Bellman-Ford 24.2-1 24-5 24.2-224.2-3 24.2-4 24.3-1 24-6 24.3-224.3-3 24.3-4 24.3-5 24.3-6 24.3-7 24.3-8 24.4* 24.5* 25 25.1-1 25-1 25.1-2 25.2 25.1-3 25.1-4 25.1-5 25.1-6 25.1-7 25.1-8 25.1-9 25.1-10 25.2-1 25-4 25.2-2 25.2-3 25.2-4 25.2-5 25.2-6 25.2-7 25.2-8 25.2-9 25.3-1 25.3-2 25.3-3 25.3-4 25.3-5 25.3-6
