I'm nearly convinced that eliminating duplicates while sorting ...leads to O(D*log(U)) performance.
Do you have an algorithm in mind? One that is compatible with a file-based merge sort?
I guess if you:
- Sort a buffer full; write to spill file eliminating dups as you go; repeat till input read.
- Parallel read from spill files, again eliminating dups as you go; until output written.
Then you'd get: O( N/S log N/S * S) + the merge.
So for 10e6 (I'm using log10 instead of log2 for easy math):
- Zero spill files: 10e6 * 7 = 70e6.
- 10 spill files: 1e6 * 6 * 10 = 60e6 + merge.
- 100 spill files: 1e5 * 5 * 100 = 50e6 + merge.
- 1000 spill files: 1e4 * 4 * 1000 = 40e6 + merge.
- ...
Of course, the merge step gets more expensive the more files you have. It is at least O(N/S log S) regardless of the ratio of U to N, so I don't think that you are going to approach O(N log U). Much less O(D Log U).
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.