A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time

#1

Post by dhruvbird » Mon, Feb 27, 2012, 2:48 AM UTC

A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time
delivery.acm.org

Re: A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time

#2

Post by petercooper » Mon, Feb 27, 2012, 2:59 AM UTC

Being behind a paywall isn't helping with its publicity. On the plus side, this reminds me I really do need to sign up for the ACM! :)

Re: A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time

#3

Post by icebraining » Mon, Feb 27, 2012, 3:01 AM UTC

petercooper wrote: post #2

Being behind a paywall isn't helping with its publicity. On the plus side, this reminds me I really do need to sign up for the ACM! :)

Searching the title returns this: http://akira.ruc.dk/~keld/teaching/algoritmedesign_f04/Artik...

Re: A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time

#4

Post by [deleted] » Mon, Feb 27, 2012, 3:04 AM UTC

petercooper wrote: post #2

Being behind a paywall isn't helping with its publicity. On the plus side, this reminds me I really do need to sign up for the ACM! :)

[deleted]

Re: A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time

#5

Post by petercooper » Mon, Feb 27, 2012, 3:06 AM UTC

[deleted] wrote: post #4

petercooper wrote: post #2

Being behind a paywall isn't helping with its publicity. On the plus side, this reminds me I really do need to sign up for the ACM! :)

[deleted]

Maybe, but it's just another paywall, selling a PDF for $39.95.

Re: A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time

#6

Post by dhruvbird » Mon, Feb 27, 2012, 3:07 AM UTC

petercooper wrote: post #2

Being behind a paywall isn't helping with its publicity. On the plus side, this reminds me I really do need to sign up for the ACM! :)

Does this link work? http://www.deepdyve.com/lp/association-for-computing-machine...

Re: A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time

#7

Post by dhruvbird » Mon, Feb 27, 2012, 3:08 AM UTC

petercooper wrote: post #2

Being behind a paywall isn't helping with its publicity. On the plus side, this reminds me I really do need to sign up for the ACM! :)

Or you can try this one if neither work: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.1...

Re: A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time

#8

Post by sold » Mon, Feb 27, 2012, 3:08 AM UTC

icebraining wrote: post #3

petercooper wrote: post #2

Being behind a paywall isn't helping with its publicity. On the plus side, this reminds me I really do need to sign up for the ACM! :)

Searching the title returns this: http://akira.ruc.dk/~keld/teaching/algoritmedesign_f04/Artik...

I get 404 at this URL but google cache is available.

Re: A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time

#9

Post by dhruvbird » Mon, Feb 27, 2012, 3:09 AM UTC

sold wrote: post #8

icebraining wrote: post #3

Earlier quoted context omitted.

Searching the title returns this: http://akira.ruc.dk/~keld/teaching/algoritmedesign_f04/Artik...

I get 404 at this URL but google cache is available.

Google Cache Link: https://docs.google.com/viewer?a=v&q=cache:n-YwxuJHeAoJ:...

Re: A beautiful algorithm that only a very few know of: In-Place Merge in O(n) time

#10

Post by icebraining » Mon, Feb 27, 2012, 3:18 AM UTC

sold wrote: post #8

icebraining wrote: post #3

Earlier quoted context omitted.

Searching the title returns this: http://akira.ruc.dk/~keld/teaching/algoritmedesign_f04/Artik...

I get 404 at this URL but google cache is available.

My bad. I've actually clicked the "Quick View" link; the possibility of being unavailable didn't cross my mind.