07-08-2010 09:25 AM
07-08-2010 09:39 AM
Can recursion be used for this challenge wiht LV 8.2?
Somewhere in there we picked-up the option to share clones but without that option, it may blow-up in LV 8.2 due to a lack of memory.
Ben
07-08-2010 10:07 AM
What would be wrong with just using a while loop that counts to 1000000. Convert each iteration to a string, filter out any number with [0,7-9], then do a simple search and replace (1=A, 2=B, etc).
Of course, it gives you repeat letters and lengths shorter than 6, but those should be easily filtered as well.
Not elegant or super fast (takes a few seconds to build it to an array, didn't try writing directly to a file), but certainly easy.
07-08-2010 10:18 AM
Its simple, and the filtering would be straight forward,
its not elegant but that would work.
hmm, nice idea. And it would be easy to see if it worked, run a line count compare to n! for that number and check for repeats and remove.
That might just do it.
I'll give it a go! 😄
07-08-2010 10:26 AM - edited 07-08-2010 10:29 AM
07-08-2010 10:39 AM - edited 07-08-2010 10:39 AM
07-08-2010 10:41 AM
sweet, here's hoping it'll run on LV v8.2 😄
07-08-2010 10:46 AM
Sorry, down-conversion to 8.0 will get rid of the in-place structure, so the attached 8.0 VI is a bit ugly. To simplify, you can remove the inner while loop without breaking anything.
Here's the string version as a 2009 VI for those who upgraded.
07-08-2010 10:54 AM - edited 07-08-2010 10:56 AM
Here is a cleaned up 8.0 version:
of course you need to be careful. Don't use very long strings or it will break because of datatype limitations. 😉
07-08-2010 10:56 AM
yup, that does the job perfectly, can even be expanded for 7, 8 etc... itterations.
does waht i needed and more 😄
now to write to a notpad file 😄