Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with recurrences
Search options not deleted
user 20561
2
votes
4
answers
4k
views
Recurrence T(N)=T(N/LOGN)+1 [closed]
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 …
- 31
1
vote
Recurrence T(N)=T(N/LOGN)+1
I'm not sure the approximation above $(LOG_2n)*(LOG_2LOG_2n)$ is correct.
Let's formulate the task in the folllowing way:
We have some number N>2,and we can divide it by $LOG_2 (N)$ while we get a …
- 31