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
根号级别的时间复杂度在算法也比较常见,最经典的例子就是试除法进行质因数分解。
The text was updated successfully, but these errors were encountered:
像acm竞赛中,块状链表、分块、莫队这些算法时间复杂度也存在根号级别 $O(n*\sqrt{n})$
Sorry, something went wrong.
No branches or pull requests
根号级别的时间复杂度在算法也比较常见,最经典的例子就是试除法进行质因数分解。
The text was updated successfully, but these errors were encountered: