Timeline for Is it beneficial to convert recursion to tail recursion?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2018 at 1:38 | history | edited | Will Ness | CC BY-SA 4.0 |
correct an error -- don't undertand how they got switched! )
|
| Dec 23, 2017 at 13:14 | comment | added | Will Ness | the call stack, that is. | |
| Dec 22, 2017 at 19:00 | comment | added | Will Ness | @greybeard non-in-place quicksort is just a treesort so should be straightforward to handle, with logarithmic simulated "stack". as for Ackermann, the size will be substantial but it shouldn't change anything. this is not about turning a recursive process into an iterative one; just about simulating the stack on the heap. | |
| Dec 22, 2017 at 18:16 | comment | added | greybeard |
Any recursion can be converted into tail recursion by can you point me to elaborations for, say, quicksort and Ackermann?
|
|
| Dec 22, 2017 at 10:37 | history | edited | Will Ness | CC BY-SA 3.0 |
added 126 characters in body
|
| Dec 22, 2017 at 10:17 | history | edited | Will Ness | CC BY-SA 3.0 |
added 724 characters in body
|
| Dec 22, 2017 at 10:12 | history | edited | Will Ness | CC BY-SA 3.0 |
added 724 characters in body
|
| Dec 22, 2017 at 10:06 | history | answered | Will Ness | CC BY-SA 3.0 |