Timeline for Solving recurrence relation where the $f(n)$ has some constant factor $k$ where $0 < k < 1$
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 31, 2019 at 18:14 | vote | accept | garbagecollector | ||
| Aug 31, 2019 at 5:22 | comment | added | D.W.♦ | @garbagecollector, no. I suggest spending some time with the definition of big-O notation. ($c$ is not allowed to depend on $n$.) This platform isn't well-suited for interactive tutoring, unfortunately. | |
| Aug 31, 2019 at 5:19 | comment | added | garbagecollector | But I can pick $c, k ∈ R$ where $kn = n^c$, right? For example $k=0.1, n=100, c=0.5$ Is this not true for all $n, c$, and $k$? | |
| Aug 31, 2019 at 5:09 | history | answered | D.W.♦ | CC BY-SA 4.0 |