Re: [CHALLENGE] finding rightmost zero bit
- From: Bart Vandewoestyne <MyFirstName.MyLastName@xxxxxxxxxx>
- Date: Mon, 29 Aug 2005 19:27:58 +0000 (UTC)
On 2005-08-29, glen herrmannsfeldt <gah@xxxxxxxxxxxxxxxx> wrote:
>
> I would say that with the traditional 1 origin arrays that
> it makes some sense to use 1 for the LSB. In mine I return
> 0 for the case of no zero bits.
There is *always* a first rightmost zero bit! So 0 is an answer
that is not possible here...
Suppose for example 3, being 11 in binary, or also being 011 in
binary... so the index to be returned here is 3.
Regards,
Bart
--
"Share what you know. Learn what you don't."
.
- Follow-Ups:
- Re: [CHALLENGE] finding rightmost zero bit
- From: N. Shamsundar
- Re: [CHALLENGE] finding rightmost zero bit
- References:
- [CHALLENGE] finding rightmost zero bit
- From: Bart Vandewoestyne
- Re: [CHALLENGE] finding rightmost zero bit
- From: James Van Buskirk
- Re: [CHALLENGE] finding rightmost zero bit
- From: glen herrmannsfeldt
- [CHALLENGE] finding rightmost zero bit
- Prev by Date: Re: [CHALLENGE] finding rightmost zero bit
- Next by Date: Re: [CHALLENGE] finding rightmost zero bit
- Previous by thread: Re: [CHALLENGE] finding rightmost zero bit
- Next by thread: Re: [CHALLENGE] finding rightmost zero bit
- Index(es):