now i know permutation become n*(n!) complex so I'm not trying to perform large permutations (just yet).
I have an array that is created, so far its just a 5 by 4 array. What I need to know if a) there is a standard library template to perform permutations on an array of [i][j] size b) if not could someone please instruct me on material that I can use to develop some code. I prefer someone to guide me in the right direction instead of coding it for me and saying "here ya go". If you do code comment please. (I'm sure I'm not the only one who wants to know)
One last thing, my array contains randomly generated numbers. (I dont think that will help any but I just wanted to give a complete description of what my code does, what I want it to do, and what I can read/study to help me get it to work :D)
I did search the forums and found permutations by N element but they always permute strings and not arrays. (or at least thats what a majority of what I found performs)
Thanks for any and all help/suggestions. And yes this is for a research project BUT its not a grade or anything or homework, hence why I said "I prefer someone to guide me" instead of coding for me.
Matrices are basically just a few arrays stapled together, such that element [n-1][i] is right before element [0][i+1]. You can take advantage of that.
you know its sad...i had to look at that page 100 times and I never thought of it that way "stapled together" lol. Thanks for the help I'll cook something up and post my solutions on here!!!!