Clear questions and runnable code get the best and fastest answer 

PerlMonks 
Comment on 
( #3333=superdoc: print w/replies, xml )  Need Help?? 
I have a working algorithm, but it needs work.
I want a program to take five arrays (@a  @e, each array runs at least 02) and a produce every permutation. This is easy for me with a for loop. But, to complicate things, I want to produce these permutations in a specific sequence  namely I want all the numbers to stay nonzero as long as possible (except the middle one, c  this one can be whatever). For example, I want 01010 to come before 02000 (two nonzeros vs. one nonzero), but a simple nested for loop gets it wrong. I was able to solve this problem and get it right, but I had to use 15 for loops like this one... where in each loop I hold an increasing number of variables at at zero. This just seems really inefficient and ugly to use 15 loops. Assuming this is clear, any ideas on how to improve this algroithm? Thanks, Greg In reply to How can I improve this? by Dogg

