程序段“i=1;while(i<=n) i=i*2;”的时间复杂度为
o(logn)
log2n
<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><msub><mi>log</mi><mrow><mn>2</mn></mrow></msub><mo data-mjx-texclass="NONE"></mo><mrow><mi>n</mi></mrow></math>
o(log2n)
O(log2n)
o(n)
O(log2)
O(log2n
)
log2(n
lon2n
nlogn
nlog2n
lgn
Logn
O(logn)
O(log2(n))
o(log 2n)
0(log2n)
log(n)
O(n)
n/2
o(sqrt(n))
log2(n)
O(sqrt(n))
㏒2
O(n^2)
O(n/2)
O(log2n)
sqrt(n)
0(log2 n)
log2(n)
O(lon2n)
1
o(log2)
O(0.5n)
O(log n)
lo g 2 n
O (Log2n)
nlon2n
O(log_2n)
用户登录可进行刷题及查看答案
登录后提交答案