A recursive solution would handle this nicely:
local sSolution
on mouseUp put empty into sSolution doPerms "","2345678" put sSolution into fld 1 end mouseUp
on doPerms pString,pPhone
if pPhone is empty then
put pString & cr after sSolution
else
put char 1 of pPhone into tChar
delete char 1 of pPhone
repeat for each char c in item tChar of "1,abc,def,ghi,jkl,mno,pqrs,tuv,wxyz,0"
doPerms (pString & c),pPhone
end repeat
end if
end doPerms
On Saturday, September 20, 2003, at 05:44 PM, Andy Burns wrote:
----- Original Message ----- From: "Dar Scott" <[EMAIL PROTECTED]> To: <[EMAIL PROTECTED]>On Saturday, September 20, 2003, at 04:50 PM, Andy Burns wrote:
I remember a program that you could type in your phone number and it would give you all permutations of what possible words could be formed.
You realize this could be 2000 to 16000 "words" depending on how many sevens there are?
Dar Scott
Dar,
The program will allow for just one phone number (for the "returninfield"
message) of seven digits to generate all possible permutations. The logic of
how to write that permutation code is what I don't grasp.
I'm simply taking one phone number and sending back all the alphabetic
(including 0 and 1 numeral) combinations that may or may not make words.
The results will be displayed in a possibly huge field for the user to scroll to see if something makes "word-sense", so to speak.
Andy Burns
_______________________________________________ use-revolution mailing list [EMAIL PROTECTED] http://lists.runrev.com/mailman/listinfo/use-revolution
regards,
Geoff Canyon [EMAIL PROTECTED]
_______________________________________________ use-revolution mailing list [EMAIL PROTECTED] http://lists.runrev.com/mailman/listinfo/use-revolution
