maintain a key.Associate with each word a key.When comparing the string,if string1>string2 swap the keys instead of the words.Saves enormous time.
On Wed, Jul 13, 2011 at 10:32 AM, nicks <[email protected]> wrote: > Algorithm along with code is explained very well in K&R refer page 108 > ;) > > > On Wed, Jul 13, 2011 at 10:26 AM, rShetty <[email protected]> wrote: > >> Given a very big file of words, a word in each line, sort the words . >> Please provide the algorithm and explanation . >> >> -- >> 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. >> >> > -- > 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. > -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- 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.
