yes, we can use a min heap of size k to keep track of the top k matching words.
On 3/28/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote: > > OK! I get it now. > In that case what we can do is instead of sorting the result, what we can > do is simply while performing a linear search for the words (that are > similar to the given word in pronunciation) we can add the matching results > into, say a list. And while inserting into that list we can ensure that it's > sorted. That way the complexity will be lesser. > > On 3/29/07, Arun <[EMAIL PROTECTED]> wrote: > > > > i believe the sorted order needed is interms of how close they are and > > not alphabetical? moreover the words neednot necc be in dictionary(like > > nouns) > > > > On 3/28/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote: > > > > > > The dictionary will already be sorted, hence the output of a linear > > > search will already be sorted! > > > > > > > > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
