Click to See Complete Forum and Search --> : Sorting Algorithm


thangaraj74
February 5th, 2009, 12:05 AM
Which data structure will be the most suitable in terms of making fast and optimized algorithm, when we wants to read data from (N) text files into memory and want to sort that data in memory

WizBang
February 7th, 2009, 11:55 AM
I think it'll depend on the type of data. For sorting string data alphabetically, the QuickSort algorithm usually beats the others.

jim enright
February 8th, 2009, 01:09 PM
you may want to consider readin the n files in, sort each individually, then
merging the info in a final step rather than reading all the files into a single record set and then sorting - this should run faster