Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^5: [OT] The interesting problem of comparing (long) bit-strings.

by salva (Canon)
on Mar 31, 2015 at 06:24 UTC ( [id://1121944]=note: print w/replies, xml ) Need Help??


in reply to Re^4: [OT] The interesting problem of comparing (long) bit-strings.
in thread [OT] The interesting problem of comparing bit-strings.

but for a linked list they are O(N log N)

No, it is also O(N2).

Replies are listed 'Best First'.
Re^6: [OT] The interesting problem of comparing (long) bit-strings.
by BrowserUk (Patriarch) on Mar 31, 2015 at 09:42 UTC

    Really? With flat array, once you've found the insertion/deletion point, you've to move (ave.) 50% of the array one place to accommodate/close up the array, but only a coupe of pointers to write for the linked list. Just wildly differing constants then.

    (I guess i was think about trees rather than linked lists.)


    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". I'm with torvalds on this
    In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others about the Monastery: (5)
As of 2024-03-28 22:54 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found