- #1
gnome
- 1,041
- 1
I'm not sure this belongs here, but I don't know where else to post it:
On a handout from my Analysis of Algorithms class there's a "Hierarchy of Functions" chart which includes familiar orders such as
log n, linear, n log n, quadratic, cubic, exponential, etc.
There is one that I've never seen before, I don't know what it means & I can't find anything written about it.
He calls it "log star", also written as log*n.
It's the second-lowest listed in the hierarchy, between "constant" and "log log"; that is, an algorithm that is O(log*n) is a very good one, better than O(log-log n).
Any ideas what it means?
On a handout from my Analysis of Algorithms class there's a "Hierarchy of Functions" chart which includes familiar orders such as
log n, linear, n log n, quadratic, cubic, exponential, etc.
There is one that I've never seen before, I don't know what it means & I can't find anything written about it.
He calls it "log star", also written as log*n.
It's the second-lowest listed in the hierarchy, between "constant" and "log log"; that is, an algorithm that is O(log*n) is a very good one, better than O(log-log n).
Any ideas what it means?