Completed initial implementation of parallel sort.  It uses an in-place ...

...merge sort implemented with parallel block exchange.  The time limit isn't set up yet, but all the parallel algorithms are cancellable.
@bsoetaer 
Okay, we might wan to consider naming it something different in the future. Can't think of any good names at the moment. 
Also I am assuming the TODO is to make it an actual binary style search rather than an incremental one.