Merge is indeed faster on multiple processors than, say, heap sort. Though it will still be nlogn. Regarding hashes - it is not clear if you want the cadidate

Merge is indeed faster on multiple processors than, say, heap sort. Though it will still be nlogn. Regarding hashes - it is not clear if you want the cadidate to mention collisions or not.