Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

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?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (15)
As of 2015-07-06 12:25 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (74 votes), past polls