We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
倒数第二小节,复杂度那边,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
The text was updated successfully, but these errors were encountered:
哈哈,这把丢人丢大了;-) 谢谢,已在wiki中更正
Original comment by rujia....@gmail.com on 3 Mar 2013 at 4:09
rujia....@gmail.com
Sorry, something went wrong.
No branches or pull requests
Original issue reported on code.google.com by
ians...@163.com
on 16 Feb 2013 at 1:51The text was updated successfully, but these errors were encountered: