|
Apr
21 |
|
comment |
GCC Compiler behavior in recursive functions He referred to how many calls in a specific recursivity function happens. For instance, In a common fibonacci recursivity function using the value 5 as the parameter, it would happen 15 calls. However, if the gcc implements caching of previously computed values, so that it would happen less calls. Indeed, this is my question. |
|
Apr
21 |
|
awarded | Student |
|
Apr
21 |
|
asked | GCC Compiler behavior in recursive functions |
