Timeline for Can a recursive function have iterations/loops?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 26, 2012 at 20:15 | comment | added | Izkata | Or even multiple calls without a loop, like traversing a plain binary tree, where you'd have 2 calls due to each node having 2 children. | |
| Oct 26, 2012 at 20:13 | history | edited | FrustratedWithFormsDesigner | CC BY-SA 3.0 |
added 65 characters in body
|
| Oct 26, 2012 at 20:12 | comment | added | FrustratedWithFormsDesigner | @PeterTaylor: Yes, I was trying to keep it simple. | |
| Oct 26, 2012 at 19:53 | comment | added | Peter Taylor | That's misleading, because it implies that there is only one recursive call, and pretty much excludes cases where the recursive call is itself inside a loop (e.g. B-tree traversal). | |
| Oct 26, 2012 at 18:29 | history | edited | FrustratedWithFormsDesigner | CC BY-SA 3.0 |
added 81 characters in body
|
| Oct 26, 2012 at 17:58 | history | answered | FrustratedWithFormsDesigner | CC BY-SA 3.0 |