Timeline for What is most efficient for GCD?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 7, 2016 at 1:03 | review | Suggested edits | |||
| Apr 7, 2016 at 2:42 | |||||
| Jun 2, 2015 at 21:30 | history | edited | Florian F | CC BY-SA 3.0 |
added 20 characters in body
|
| Jun 2, 2015 at 21:28 | comment | added | Florian F | But for short code like this, the difference is significant. Stack-consuming means writing to and reading from memory. That is slow. The code above runs on 2 registers. Recursivity also means doing calls, which is longer than a conditional jump. A recursive call is much harder for branch prediction and harder to inline. | |
| Jun 2, 2015 at 20:48 | comment | added | Gilles 'SO- stop being evil' | “Avoid recursivity. It is slow” — presented as general advice, this is bogus. It depends on the compiler. Usually, even with compilers that don't optimize recursion, it isn't slow, just stack-consuming. | |
| Aug 31, 2014 at 21:18 | review | First posts | |||
| Aug 31, 2014 at 21:34 | |||||
| Aug 31, 2014 at 21:14 | history | answered | Florian F | CC BY-SA 3.0 |