40 2 80
1
1
count=0;
for(k=1;k<=n;k*=2)
for(j=1;j<=n;j++)
count++;
2
A O(log n) B O(n) C O(nlogO(nlog n)n)nnnnnnnn D O(n )
2 22222222222
2 a/b+(c*d-e*f)/g
)/g
f
A + ( * - B + ( - * C/ + ( * - * D/ + - *
C /// +++++++++++++++++++++ ((((((((((( * - * DDDDDDDDDDDD / + - *
3 A[0…M-1]end1 end2
] end1 eneneneneneneneneneneneennnd2d2d2d2d2d2d2d2d2d2d2d222
M-1
M-1
eneneneneneneneneneneneeeneneeeennd1d1d1d1d1d1d1d1d1d1dd11 ==== (e(e(e(e(e(e(e(e(e(e(e(((eeeeendndndndndndndndndnddd2+2+2+2+2+2+2+2+22+2222 1)mod M
A end1 == end2 end1 == (end2+1)mod M
2 end2 ================= (e(e(e(e(e(e(e(e(e(((((eendn 1+1)m
B end1 == end2 end2 == (end1+1)mod (M-1)
(end 1+1))))))))))))momomomomomomomomomomooooodddddddddddddd MMMMMMMMMMMMMMMMMMMMMMMM ennnnnnnnnnnnnd1d1d1d1d1d1d1d1dd1ddd1dd1d111 == (end2+
C end2 == (end1+1)mod M end1 == (end2+1)mod M
== (end2+ 1)))))))momomomomomomomommmommommmoddddddddddddddddd MMMMMMMMMMMMMM eenenenenenenenenenenend2d2dddd2d