- #1
XodoX
- 203
- 0
Homework Statement
Loglog n and 2^log*2
Homework Equations
O(g(n)) (big O)
Ω(g(n))
ω(g(n))
The Attempt at a Solution
Theta is worse case and Big O gives you the upper bound of the function f(n) etc. Question is, how do I evaluate those 2 algorithms using them? Do I just plug in numbers or what? I don't quite get it. I want to compare the 2 algorithms by using those parameters, so I need to get the values and compare them.