I implemented bucket sort in D to demonstrate how easy it is to use std.parallelism. I welcome any feedback.
One thing: I would suggest to avoid using ~= in a tight loop, as it is rather slow. Using std.array.appender for the first loop and std.array.join for the second one should be much faster.
-- Best regards, Vladimir mailto:[email protected]
