[問題] 時間複雜度

[forris (喬巴)]

(一).
      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
推 DeathSimon:1.是  2.O(n lg n)
→ forris:可以講詳細一點嗎?
推 smallworld:看看SUM值跟N值關係就知道了 要學計算
→ smallworld:分析請參考master method or resursive tree