steps to reproduce

Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

Add more "towel" puns and jokes anywhere appropriate: readme, xml documentation, docfx, etc.

Examples:

A .NET library intended to make coding a bit more towelerable

_{from the top of the readme}

Throw in the towel.

_{from the description of this repo}

I tried to tell a joke about towels...
But people don’t like my dry humor.

_{my thoughts on #82</su}

It seems that a few platforms add nasty fake EXIF dates to their images, which means they're renamed and sorted to basically random folders.

Could it be implemented that phockup passes/skips images that have dates before the invention of digital cameras or more than a few months in the future?