[理工] [資結]-成大97資工 程式設計

[shinhwabo (.....)]

Solving the recurrence T(n)=2T(└√n┘)+㏒n using big-O notation as
tight as possible

求板上的高手幫忙解答 thx

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 58.114.130.207