Given a big set which contains 1 billion random numbers(not sorted and
there maybe some duplicates),how to find 1 million largest numbers in it
(a)using just one single machine.(You need to consider the memory constraint)
(b)using multiple machines. How to design it? Need to give the details.
(a) External selection algorithm
(b) distributed selection algorithm
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment