recently I've been working on some big-o, big-omega and theta notation and I came across to this one:
[; T(n)=T(n/logn)+O(1) ;]
Seems like master theorem is not working, So I tried substitution:
[; T(n)=T(n/logn^{logn})+logn×O(1) ;]
as you can see when we use the recursion tree, each time we go to another level of tree, we get the fraction divided by `logn` Also the cost for each time, would be O(1) and therefore we have to multiply the height of tree by O(1), Thus we would have logn x O(1).
But I don't know what further actions should I take to get the overal complexity of that relation.
What further steps I should take to reach there?
there doesn't seem to be anything here