Timeline for Solving T(n,m) = 3n + T(n/3,m/3)
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2021 at 10:33 | comment | added | Yuval Filmus | Indeed, $O(f + g)$ is the same as $O(\max(f,g))$. | |
| Sep 22, 2021 at 9:13 | comment | added | gnasher729 | The recurrence is really strange. It seems that T(n, n^4) = O(n^3), but T(n^2, n^4) is only O (n^2). Or T(x, y) = O (max (x, y/x)). | |
| Sep 21, 2021 at 21:04 | history | answered | Yuval Filmus | CC BY-SA 4.0 |