Re: Count maximum contiguous set bits in an integer .
- From: websnarf@xxxxxxxxx
- Date: 29 Apr 2005 04:05:04 -0700
Vish wrote:
> I have written a program to count the maximum contiguous set bits in
> an integer.
> Like if my binary representation of integer is :
> 1100111 : then output should be 3.
> 111000111110000101010111111 : then output should be 6.
>
> I am including the snippet below.
> How can I optimize this code and also is there a one liner to
> implement the same.
> (Like for power of 2 we have got (number & (number -1))).
How about a 5 liner?
int longest1BitsCount (unsigned long l) {
int i;
for (i=0; l; i++) l &= l + l;
return i;
}
Like any other program, I have no idea what this does on a 1s
complement machine (and don't really care).
---
Paul Hsieh
http://www.pobox.com/~qed/
http://bstring.sf.net/
.
- Follow-Ups:
- Re: Count maximum contiguous set bits in an integer .
- From: Lawrence Kirby
- Re: Count maximum contiguous set bits in an integer .
- References:
- Prev by Date: Caaling assembly routine in c
- Next by Date: Re: how to use static function defined in one file in another file is that impposiible in 'c '
- Previous by thread: Count maximum contiguous set bits in an integer .
- Next by thread: Re: Count maximum contiguous set bits in an integer .
- Index(es):
Relevant Pages
|
