comment on

I know you won't like me saying this,

I have no problem with you saying it; though I somewhat fear what the consequence might be given previous examples.

this comment: “give me all 3-tuples in the domain 0..5 such that none of the values in the tuple are duplicated.” ... is actually interesting

So, the question is, where did he steal it from?

and the idea of using a recursive function also makes some sense (although, to tell the truth, I fail to see the relevance of ... the eight-queens problem

Exactly. None.

directly searching for all unique N-tuples in a set of M unique elements, I came up with this

You came up with a solution.

His posts are like those "Your Stars" astrology pieces in newspapers; so vague that you can read just about anything into them.

But your solution bears no resemblance to the "pseudo-code" he posted; and that bears no resemblance to any language I know; nor anything vaguely workable.

Computing almost 1.7m solutions in just over half a second is not too bad, it seems to me, but I have no idea on the dimensions of the actual problem you are trying to solve. This solution can easily be ported to C, I think, if performance needs to be higher.

Three thoughts:

My current solution (posted and refined by Anonymonk above) is iterative; which generally outstrip recursive solutions.
(That's why compilers attempt to convert recursion to iteration.)
How would you convert that recursive solution into an iterator, as requested in the title and described in the OP?
It's relatively easy to do in Perl; you just write it to take a callback (code block), but much harder to do in C.
How does it do on 32/16?
Does it find all 601 million solutions? Does it come close to doing so in 5s?

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority". I'm with torvalds on this

In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked

In reply to Re^2: Odometer pattern iterator (in C). (Updated.) by BrowserUk
in thread Odometer pattern iterator (in C). (Updated.) by BrowserUk

Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!

Titles consisting of a single word are discouraged, and in most cases are disallowed outright.

Read Where should I post X? if you're not absolutely sure you're posting in the right place.

Please read these before you post! —

Posts may use any of the Perl Monks Approved HTML tags:

a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr

You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)

	For:		Use:
	&		`&`
	<		`<`
	>		`>`
	[		`[`
	]		`]`

Link using PerlMonks shortcuts! What shortcuts can I use for linking?

See Writeup Formatting Tips and other pages linked from there for more info.