kazusa
/
offer
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update README.md

This commit is contained in:
灶门小豆子 2022-08-05 22:22:52 +08:00 committed by GitHub
parent b8a4ad4f45
commit daf5e589ac
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
README.md
View File

@ -47,7 +47,7 @@ public class OneCount {
# hash
# 递归
### master公式
形如T(N) = a * T(N/b) + O(N^d)(其中的a、b、d都是常数)的递归函数，可以直接通过Master公式来确定时间复杂度
如果 log(b,a) < d，复杂度为O(N^d)
如果 log(b,a) > d，复杂度为O(N^log(b,a))
如果 log(b,a) == d，复杂度为O(N^d * logN)
形如T(N) = a * T(N/b) + O(N^d)(其中的a、b、d都是常数)的递归函数，可以直接通过Master公式来确定时间复杂度<br />
如果 log(b,a) < d，复杂度为O(N^d)<br />
如果 log(b,a) > d，复杂度为O(N^log(b,a))<br />
如果 log(b,a) == d，复杂度为O(N^d * logN)<br />