Skip to content
New issue

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

在2.3时间复杂度中建议补充时间复杂度类型根号阶 #1292

Closed
Transmigration-zhou opened this issue Apr 19, 2024 · 1 comment
Closed

Comments

@Transmigration-zhou
Copy link
Contributor

根号级别的时间复杂度在算法也比较常见,最经典的例子就是试除法进行质因数分解。

@Transmigration-zhou
Copy link
Contributor Author

像acm竞赛中,块状链表、分块、莫队这些算法时间复杂度也存在根号级别 $O(n*\sqrt{n})$

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants