I've ust reciently had to do an assignment for uni. A concurrent (multi-process) merge sort.
Just outta curiosity, would a concurrent merge sort be more efficient then a single process merge sort?
I'm guessing that for smaller sorts the single process may be faster, but larger sorts the concurrent program would be faster.
Just curiouse if anyones got any input...