A little faster than the old version

This version tags the first value of each A block, removes the cached version of Rotate, and uses slightly modified versions of MergeInto and MergeInPlace. Testing::Random went from 3% faster to 7% faster, so that's good I guess.
Starting to update the benchmarks
Removing the cached version of Rotate()
Tag the first value of each A block
Bug fix (indexA was wrong)

Hey, at least it's in the Development branch this time!
Updating the benchmarks some more
More updates to the benchmarks
Finishing up the new benchmarks
Feature parity with the C++ version

This version of WikiSort tags the first value of each A block, and uses slightly modified versions of MergeInPlace and MergeInto. Overall it's a little faster.
Slight changes

This version of WikiSort tags the first value of each A block, and uses slightly modified versions of MergeInPlace and MergeInto.
Slightly faster than the old version

For some reason using std::rotate() on its own is faster than using the cache for small rotations? Using the cache is a lot faster in the C version. I tried copying and pasting the source code for std::rotate() into WikiSort but it still wasn't faster than the cached version. Not sure what causes that.

Anyway, this also tags the first value of each A block and uses modified versions of MergeInPlace and MergeInto. The main speed improvements were from using std::rotate(), though.
Adding the cached version of Rotate back again...

The cached version of Rotate is faster in the C version, but not the C++ version. Huh.
Merge pull request #20 from BonzaiThePenguin/Development

Slightly faster than the old version