Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #1113
| From | Wes Groleau <Groleau+news@FreeShell.org> |
|---|---|
| Newsgroups | comp.programming, comp.theory, sci.math, comp.graphics.algorithms |
| Subject | Re: Help with graph theory puzzle solution analysis |
| Date | 2011-12-18 00:28 -0500 |
| Organization | Ain't no organization here! |
| Message-ID | <jcjtm9$bei$1@dont-email.me> (permalink) |
| References | <a27eff22-1530-473e-8b32-81a7b81712e5@d8g2000vbb.googlegroups.com> <20111217201224.H69688@agora.rdrop.com> |
Cross-posted to 4 groups.
On 12-17-2011 23:37, William Elliot wrote: > It appears to be recursive programming, ie a routine that repeatedly > calls itself until an exit condition is meet. I don't see a call to itself anywhere in it. Do you mean that it is "unrolled" recursion? -- Wes Groleau Be spontaneous … today http://Ideas.Lang-Learn.us/BlindDog?itemid=3984
Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Help with graph theory puzzle solution analysis Andrew Tomazos <andrew@tomazos.com> - 2011-12-17 14:23 -0800
Re: Help with graph theory puzzle solution analysis William Elliot <marsh@rdrop.com> - 2011-12-17 20:37 -0800
Re: Help with graph theory puzzle solution analysis Wes Groleau <Groleau+news@FreeShell.org> - 2011-12-18 00:28 -0500
Re: Help with graph theory puzzle solution analysis Joshua Cranmer <Pidgeot18@verizon.invalid> - 2011-12-17 22:56 -0600
csiph-web