Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

Re^2: bit-vector > global minimum

by baxy77bax (Chaplain)
on Oct 03, 2011 at 17:20 UTC ( #929383=note: print w/ replies, xml ) Need Help??

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

but this implies that i would need to do this for every given pair of indexes which would lead to a:

If X = |A[i,j]|, O(X) time algorithm which is higher then my tree solution that runs in O(logX) if i understood you correctly

But never the less, this is a nice trick that didn't cross my mind. Thank you !!!!

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

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (12)
As of 2015-09-03 13:45 GMT
Find Nodes?
    Voting Booth?

    My preferred temperature scale is:

    Results (112 votes), past polls