Closed GoogleCodeExporter closed 8 years ago
倒数第二小节,复杂度那边,O(2^(n/2)*logn)即O(1.44^(n)*logn) sqrt(2)=1.414
Original issue reported on code.google.com by ians...@163.com on 16 Feb 2013 at 1:51
ians...@163.com
哈哈,这把丢人丢大了;-) 谢谢,已在wiki中更正
Original comment by rujia....@gmail.com on 3 Mar 2013 at 4:09
rujia....@gmail.com
Original issue reported on code.google.com by
ians...@163.com
on 16 Feb 2013 at 1:51