mirror of
https://github.com/dholerobin/Lecture_Notes.git
synced 2025-03-16 14:19:58 +00:00
Update DSU.md
This commit is contained in:
parent
29d9121501
commit
5fb63b0252
@ -224,7 +224,7 @@ int Find(x)
|
|||||||
|
|
||||||
**Note:**
|
**Note:**
|
||||||
- $log^*(N)$ is the **iterated logarithm**, which is essentially the number of times we have to apply $log$ to $N$ before it becomes less than or equal to 1.
|
- $log^*(N)$ is the **iterated logarithm**, which is essentially the number of times we have to apply $log$ to $N$ before it becomes less than or equal to 1.
|
||||||
- $\mathcal{O}(\log^*(N))$ is almost constant time becuase $\log^*(N) <=5$ for even such a big number like $2^{65536}$.
|
- $\mathcal{O}(\log^*(N))$ is almost constant time becuase $\log^*(N) \leqslant 5$ for even such a big number like $2^{65536}$.
|
||||||
|
|
||||||
## Operation Union
|
## Operation Union
|
||||||
|
|
||||||
|
Loading…
x
Reference in New Issue
Block a user