nikhilwason
09-20-2003, 01:08 PM
im in need of an algorithm 2 generate all possible combinations 4 'n' numbers.
4 eg : we can hv 8 boolean nos. thus 2^8 combinations will hv 2 b generated. This can b done using 8 loops. But the problem is that the number of boolean nos. ( ie 8 in this eg ) is taken only @ runtime from the user.
Can anybody help??
4 eg : we can hv 8 boolean nos. thus 2^8 combinations will hv 2 b generated. This can b done using 8 loops. But the problem is that the number of boolean nos. ( ie 8 in this eg ) is taken only @ runtime from the user.
Can anybody help??