even now i search through the paragraph linearly but 'word by word' and once for each word to be marked and before inserting any tag... searching the paragraph linearly 'char by char' would make the algorithm more complex as i would have to check for each character whether it is '<' or '>' or the beginning of a to be marked according to ur logic
On Sep 18, 12:26 am, "daizi sheng" <[EMAIL PROTECTED]> wrote: > yes I also think linearly searching is enough, :) > even you have > 1M words, you can use something like hash for testing if it > occur at the current position > just post what you think the problem it (because you said "linearly > searching through the paragraph > for words and tagging them would not work obviously", but I can not see why) > > 2007/9/18, adak <[EMAIL PROTECTED]>: > > > > > Linearly searching through the text (including the tags) WILL work > > just fine, gomsi. > > > Post up a troublesome example, and I believe I can show you. --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
