作者forris (乔巴)
看板Prob_Solve
标题[问题] 时间复杂度
时间Mon Mar 10 23:46:43 2008
(一).
begin
sum = 0
for i = 1 to n do
for j = 1 to n do
sum = sum + 1
end
这题是 O(n^2) 吗？
(二).
begin
sum = 0
for i = 1 to n do begin
j = n
while j > 0 do begin
sum = sum + 1
j = [j/2]
end
end
end
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 59.116.194.95
1F：推 DeathSimon:1.是 2.O(n lg n) 03/10 23:49
2F：→ forris:可以讲详细一点吗? 03/11 00:23
3F：推 smallworld:看看SUM值跟N值关系就知道了 要学计算 03/11 00:29
4F：→ smallworld:分析请参考master method or resursive tree 03/11 00:30