Re: [CHALLENGE] finding rightmost zero bit
- From: Michel OLAGNON <molagnon@xxxxxxxxxxxxxxxxx>
- Date: Mon, 29 Aug 2005 18:28:47 +0200
I claim the slowest but it's a one-liner:
pos = nint (log (real(ieor(n,n+1)+1, kind=renough)) / log (2.0_renough))
:-)
.
- Follow-Ups:
- Re: [CHALLENGE] finding rightmost zero bit
- From: *** Hendrickson
- Re: [CHALLENGE] finding rightmost zero bit
- From: Bart Vandewoestyne
- Re: [CHALLENGE] finding rightmost zero bit
- References:
- [CHALLENGE] finding rightmost zero bit
- From: Bart Vandewoestyne
- [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):
