B Trees data structures are optimal for such problems. These algorithms help to access large amount of data which we cannot fit into main memory .
On Fri, Jul 29, 2011 at 2:58 PM, Puneet Gautam <puneet.nsi...@gmail.com>wrote: > If u have to sort a large amount of data,but the memory space is > insufficient for the same...How would u sort the data..? > > Reply asap everyone.. > > Thanks in advance...! > > -- > 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. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Regards Rajeev N B <http://www.opensourcemania.co.cc> "*Winners Don't do Different things , they do things Differently"* -- 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. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.