How would you optimally sort an unsorted random list of numbers by using multiple computers.
Interview Answers
Anonymous
19 Feb 2010
quick sort or merge sort would do. They can be easily parallelized.
1
Anonymous
19 Jun 2010
Along with quick sort and merge sort, we can also do counting sort if:
i) The elements are integers.
ii) If the range of elements i.e. ints is limited (say k).
Complexity: O(n+k.)