Timeline for Invert the bits of a non-negative integer in Common Lisp (SBCL)
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2017 at 14:30 | comment | added | Gustav Bertram | Doh! Well, this certainly has been very educational. Thank you. | |
| Jan 10, 2017 at 14:25 | comment | added | Rainer Joswig | @GustavBertram: TCO depends on the implementation. But your code is not tail-recursive anyway, since the self recursive call is not in tail position. | |
| Jan 10, 2017 at 14:23 | comment | added | Gustav Bertram | Good point about blowing the stack. I had assumed it would be tail-recursive, but that may indeed not be the case. | |
| Jan 10, 2017 at 14:13 | history | answered | Rainer Joswig | CC BY-SA 3.0 |