If you were to read a file with a list of different words, split the words into m/n parts, where m is the number of words and n is a given argument, then sort those parts with n threads and finally merge them together with threads (same or new ones), how would you do it?
It was a task I was given not long ago, though I delivered I didn't feel like I could come up with a good answer… What would you do?








