Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^2: bit-vector > global minimum

by dwm042 (Priest)
on Oct 03, 2011 at 17:17 UTC ( [id://929382]=note: print w/replies, xml ) Need Help??


in reply to Re: bit-vector > global minimum
in thread bit-vector > global minimum

Choroba,

This algorithm you suggest would fail on a bit vector of 15 1s followed by 5 zeroes.

David.

Replies are listed 'Best First'.
Re^3: bit-vector > global minimum
by choroba (Cardinal) on Oct 03, 2011 at 17:26 UTC
    I updated the algorithm, an important part was missing from the post (silly me). It should work now:
    1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 - - 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 - - - - 0 0 0 1 1 1 1 1 1 1 1 1 1 1 - - - - - - 0 0 1 1 1 1 1 1 1 1 1 1 - - - - - - - - 0 1 1 1 1 1 1 1 1 1 - - - - - - - - - - ^ minimum

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://929382]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others cooling their heels in the Monastery: (4)
As of 2025-06-19 12:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.