以下算法中加下划线的语句执行次数为()。int m=0,i,j;for(i=1;i<=n;i++)for(j=1;j<=2*i;j++)m++;
A. n
B. n+1
C. n(n+1)
D. n*n
查看答案
某算法的时间复杂度为O(logn),表明该算法的()。
A. 问题规模是O(logn)。
B. 执行时间等于O(logn)。
C. 执行时间与O(logn)成正比
D. 问题规模与O(logn)成正比。
This offer______on October 20, 2017. Your immediate reply by E-mail will be appreciated.
A. extends
B. expires
C. includes
D. stops
We can______you that our products are superior in quality and reasonablein price.
A. ensure
B. sure
C. assure
D. insure
We are not in a position to offer firm, as the goods are______.
A. without stock
B. not in stock
C. out of stock
D. no stock