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

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

No, it is also O(N²).

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

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

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

[reply]