Add example for binary heap performance for paging.
Added sort and page via a priority queue backed by a sorted list.

Added validation of results.
I like Linq
Added sort and page via a priority queue backed by a binary heap.
I wanted to see what the overhead of the Linq OrderBy with delegate was.
Commented out the Linq version b/c it takes too long.
Make the sorted list version a little faster but looping down to 0.

Make the heap version a little faster by removing a conditional.
Apply same loop optimization from the sorted list version to the heap version.
Added some more runs.
Make the sorted list version a little faster.
Increase the number of items to sort/page.

Add a reference timing for just the loop and compare.
Cleanup the sorted list version.
It's always nice to write less code...
WTF?

This almost cuts the time in half...
No real performance change.

Just style...
Renamed project.
Did some cleanup b/c the decrement really isn't a performance win.

Interestingly, this causes a worst case scenario for the priority queues...and the binary heap comes out much better.
Refactoring to add warm up runs and multiple iterations.
Renaming of the full sort/sort all variation.
Refactored descriptions.

Added iterations against fully sorted lists - both ascending and descending.
Code cleanup of the sorted list variation.