Added link to /r/BlockMergeSort
Added link to new paper
Renamed to be crossplatform

On some systems (for example, Windows) files with ':' characters in are
disallowed.
99% implemented now!

Had to change the way the internal buffers are extracted, and how the
algorithm responds when it could not find enough unique values to fill
the buffers.

These changes make TestingRandomFew run 75% as fast as stable_sort now,
while before it was only 15% (!) as fast. Still need to clean up the
code, possibly optimize here and there, and try out different
algorithms for the third branch in Merge to see which is the best.
Oops
Idiomatic markdown
Virtual memory, not VRAM
Merge pull request #9 from Duta/master

Markdown changes
Fixing links

Need to go through and fix the broken links, don't mind the dust.
Fixing broken links
Fixing broken links
Fixing broken links
Fixing broken links
Fixing broken links
Code cleanup and fixed typos
Clarifying when to use the in-place merge
Formatting and other changes
Added "comparisons" benchmark, and fixes

The part of the code that pulls out two internal buffers really only
needs to pull out one if the second buffer can fit into the cache.
That's been fixed. Also added a counter for tracking how many times the
compare function is called for each sort algorithm.
Uses unsigned values, new Iterator class

The previous versions were not ready for more than 2^31 or 2^63 items
in an array, due to its use of signed longs, but the new version uses
unsigned values. It was tested in unsigned shorts with arrays greater
than 32768 to make sure the math is correct.

Also added an Iterator class to cut down on the repetitive decimal_step
logic.
Adding ignore file.