[Date Prev] [Date Next] [Thread Prev] [Thread Next] Date Index Thread Index Search archive:
Date:Mon Feb 22 12:28:00 1993 
Subject:Permutations/Combinations 
From:James Anderson 
Volume-ID:930223.01 

ianr@syma.sussex.ac.uk (Ian Rogers) 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 :-)

See * REF NUMBERS

integer_bitcount(INT) -> N                                   [procedure]

:-)

-- 
James Anderson.  (JANET) James.Anderson@reading.ac.uk
                 Department of Computer Science, University of Reading,
                 Whiteknights, Reading, Berkshire, UK, RG6 2AX.