[演算] Answers of hw2 is announced
Download this on the following link:
http://www.csie.ntu.edu.tw/~r95121/algo/hw2ans.pdf
In 3(b), notice that T(n) = floor(lg1) + floor(lg2) + ... + floor(lgn).
It's not so trivial to derive T(n) = Omega(nlgn)
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.229.187.13
推
11/26 13:58, , 1F
11/26 13:58, 1F
討論串 (同標題文章)