Sort an integer array filled with random numbers, and distributed over MPI nodes.
The maximum array size N for a node must be at least three times smaller than the memory available to the node.
The algorithm is very simple and not optimal:
- Recursively subdivide node range until we got a single node
- Sort the subarray on this node
- Recursively merge arrays from neighbors nodes