Permutation and Combination
Hi please help me.. I am writing a larger program which requires the below modulde..
I want the program to take an multidimensional integer array os size n x n1. Which contain only the numbers 1, 0 and -1.
for example..
1 0 0 0
or
-1 0 -1
or
0 0 0 0 1 1 -1 0
So i want the program to alter the 0's to both 1 and -1 and get all possible combinations. But it should not alter the already present -1 and 1. it should just aler the 0's.
Help Me please...
You could count the number of zeros you have (and the posistions they occupy). Create a temporary array the size of the number of zeros, and use an algorithm to generate the possible combinations of this temporary array. Each time a combination is generated put it back to the into the original array.
That cannot be done since the number of zeros can be at some ties upto 300 to 600. So writing such an algorithm based on the position will be really big...
