tag:blogger.com,1999:blog-8601579266012455634.post635200207764127270..comments2011-03-21T21:09:10.398-07:00Seth Laddhttps://profiles.google.com/118397406534237711570noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-8601579266012455634.post-15533585243580004112009-10-16T17:30:09.000-07:002009-10-16T17:30:09.000-07:00To make it support virtually any number of combination string length, one way is to generate the binary count string with a r-permutation engine and then use that string to filter out the combinations. I have implemented an r-permutation generator and a combination generator. You may check both here: <br>http://wp.me/pmGbq-8B<br>http://wp.me/smGbq-rpermrep<br><br>Although the unlimited length combination generator is not implemented, but with these two it is very easy. But ofcource there will be performance penalty cause after the bitstring is made there are no more bit operations, and also you need to generate r-permutations which costs you.phoxishttp://phoxis.wordpress.comnoreply@blogger.com