Subj : Faster matrix permutation algorithm?
To   : comp.lang.c,comp.programming
From : Jack Middleton
Date : Sat Aug 13 2005 03:26 pm

Hi!

I'm lookin for a faster permutation algorithm for matrices. I know that 
it can be done with multiplying a matrix with a permutation matrix. It 
just seems a waste to iterate through all those zeroes. Is there an 
algorithm for matrixes that is optimized just for permutations? The 
matrices that I use are fairly small (around 6*6) and I only use 
positive integers as elements.

Thanks for help,

Jack Middleton

.