Parallel Merge Sort

[Xinok via Digitalmars-d]

On Tuesday, 3 March 2015 at 22:55:05 UTC, Josh wrote:
> How can I make my parallel code more efficient. Currently, I am 
> getting destroyed by the serial merge sort.
>
> http://pastebin.com/M0GKfTTX
>
> Thank you.

I've implemented a concurrent merge sort if you want to take a 
look at my code. It's much faster than "serial" merge sort.

https://github.com/Xinok/XSort/blob/master/mergesort.d#L88