Ok, Mike is correct that i should not help you in working out a brute force algorithm 😉
Nevertheless, since it is a demanding request, i give you some hints:
a) Handle it in a recursive way
b) The modulo operation (Quotient&Reminder) is your friend
c) there is a reason why most algorithms do not compute all valid permutations but "roll the dice on it"......
hope this helps,
PS: If the amount of valid elements would match the number of elements, this request could be solved fairly nicely with building all permutations on purpose. If there is no such match, rolling the dice is coming much more handy......
the algorithm shouldn't be the problem, you can see an example from Delphi here
I think the more tricky thing is to make it fast. In LabVIEW you should avoid using string arrays to store the results. Much faster is to write it directly into a file.
"can you convert for LV v8.2 please?"
No, it uses Recursion capability of LV2009... Time to upgrade?
That's the block diagram of the permutation VI:
"String in" is the string converted to an U8 array, "strings out" will be converted back in the main VI... (And the subVI is the VI itself - Recursion!)
ah damn, now i understand the 'its a dream' i thought you meant 'it didn't work in LV9'
no stuck with LV 8.2 for now
i guess it become a question of which is easier;
Build a recursive vi for lv 8.2
Try the sequence idea
I'm sure there is a method in the repeating and holding the already used characters using logic.
you can use the code from Gerd. The only thing you need to do is to load the VI dynamically, then it's possible with recursion.
sort of copy and paste? or do i need to download their softwere to see it?
how do you load dynamically - VI run settings?