Divide records into parts that could fit into main memory. Do rank find algorithm for certain range if necessary.
On Feb 16, 7:26 pm, bittu <[email protected]> wrote: > given a very large file (millions of record), find the 10 largest > numbers from it.in minimum time complexity > Don't think about hashing . Again Its Flat File Not the Database > > Thanks & Regards > Shashank Mani -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
