|No such thing as a small change|
Re^8: Locating a specified number of contiguous 0 bits within a large bitstring efficiently.by BrowserUk (Pope)
|on Jun 08, 2013 at 06:20 UTC||Need Help??|
First of all, my code doesn't do $N < 8 ... so you'd only expect to see correct answers from 5 on down.
Obvious. (Once someone kindly points it out.)
I'm getting the correct numbers for 14..17 when I run it so I'm guessing there's something else going on with either your testbed or mine
Indeed, mine! (A dumb typo.)
My only excuse is attempting to give timely response to your efforts, whilst also construct a descent testbed and benchmark for 4 different approaches (3 posted + my own.). My own attempt -- essentially based on the ideas in the OP -- is proving to be a pain to code.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.