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 
This isn't supposed to find the index of the actual target value - just the index of the first element that is not less than the target value.