Re^2: bit-vector > global minimum

Choroba,

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

David.

Comment on Re^2: bit-vector > global minimum

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` [download]	[reply] [d/l]

Replies are listed 'Best First'.

Re^3: bit-vector > global minimum
by choroba (Cardinal) on Oct 03, 2011 at 17:26 UTC

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
[download]

[reply]
[d/l]