Xref: utzoo comp.lang.c:33145 comp.sources.wanted:13777
Path: utzoo!attcan!uunet!mcsun!inria!loria!loria.crin.fr
From: anigbogu@loria.crin.fr (Julian Anigbogu)
Newsgroups: comp.lang.c,comp.sources.wanted
Subject: String Generation/Combination
Message-ID: <2836@loria.crin.fr>
Date: 24 Oct 90 12:42:33 GMT
Sender: anigbogu@loria.crin.fr
Followup-To: comp.lang.c
Organization: CRIN & INRIA Lorraine, Nancy, France
Lines: 22

Dear Netters, I have a little problem and was wnadering if any of you has 
already solved an identical one. Here goes:
	Given two 2 equal length strings, say L, I would like to generate all
possible strings of length L. (2^L strings). String uniqueness is not 
necessary but if the function eliminates duplicates as it generates, that'll
be a bonus.

	ex. "worb" and "ward" should  generate
		worb
		word
		ward
		warb
		...
If you have a solution, I'd love to hear from you and in this newsgroup or by
email. Thanks in advance.

Julian
-- 
				---------------------------------------
e-mail:	anigbogu@loria.crin.fr 	| All opinions expressed here are      |
				|  naturally mine. However ...         |
				----------------------------------------