@Dumanshu : Implement the tournament tree as a Min Heap. Its prety
straight forward to do that. If you have any doubt, plz ask ??
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
Dont know the answer though..but still my 2 cents .. create multiple threads
to simulate different client machines..create one more thread for the server
to assign a million numbers to each client thread..seems kind of weird
though!
On Mon, Jul 18, 2011 at 6:23 PM, Dumanshu wrote:
> Given billio
Given billions of unsorted numbers and we need to find first 1 million
numbers if all the numbers were sorted in non-descending order.
approach is to split up the numbers to multiple machines and sort
them.
Then make a tournament tree in such a way that each machine feeds the
lowest number it has,
