super_log(欧拉降幂)
n Complexity theory, some functions are nearlyO(1)O(1), but it is greater thenO(1)O(1). For example, the complexity of a typical disjoint set isO(nα(n))O(nα(n)). Hereα(n)α(n)is Inverse Ackermann ...
原创
2019-09-02 21:28:18 ·
269 阅读 ·
0 评论