Date: | Mon Feb 16 10:59:37 1993 | |
Subject: | Re: Permutations/Combinations | |
From: | Ian Rogers | |
Volume-ID: | 930220.01 |
jadwa@isg.reading.ac.uk (James Anderson) writes: > n > 2) Count on the bit string (or integer) from 0 to 2 - 1. > > Its that simple. And for your next trick you'll show us a neat way of telling when exactly k out of the n bits are set :-) > P.S. What is a FAQ? Frequently Asked/Answered Questions. Ian. |