Timeline for Attempt at method to draw diamond (recursive or not ?)
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 9, 2013 at 9:41 | comment | added | bowmore | It's not a problem that lends itself to tackling with recursion, unless you find an easy way to draw an n size diamond starting from an n-2 size diamond | |
| Aug 9, 2013 at 8:09 | comment | added | James P. | It's not recursive but I like how the problem has been separated into different tasks. I have changed the title to suit. | |
| Aug 8, 2013 at 22:16 | comment | added | bowmore | @tomdemuyt That the OP attempted to solve it with recursion, does not imply it is the most elegant solution. | |
| Aug 8, 2013 at 21:46 | comment | added | konijn | But then it is not recursive any more ;) | |
| Aug 8, 2013 at 21:37 | history | answered | bowmore | CC BY-SA 3.0 |