You are viewing a single comment's thread. Return to all comments →
Constantly get timeouts.
Have a theoretical doubts:
If I use a function
int f(int x) { if (x <= 1) return 1; return f(x/2) + f(x/2 - 1); }
what complexity there is?
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #117: Red, green, and blue tiles
You are viewing a single comment's thread. Return to all comments →
Constantly get timeouts.
Have a theoretical doubts:
If I use a function
what complexity there is?