I'm stuck on the following reccurrence :
T(N)=T(N/LOGN)+1,IF N>2
T(N)=0,if 0<=N<=2
I need a function T(N) for all N>0 Is there some method for solving it? Can we at least get some tight asymptotic bounds for T(N)?
Recurrence T(N)=T(N/LOGN)+1
iensen
- 31
- 1
- 4