@ankit
u can'nt use TRIE
becoz , input will be given in form of text
so generating the TRIE will be much expensive than linear search

On Fri, Dec 10, 2010 at 3:13 PM, GOBIND KUMAR <[email protected]> wrote:

> Help me in solving this problem...       Define a data struct for the search 
> engine which will represent whether
>
> given word is there in the document or not .It  should be fast.
>
>  --
> 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]<algogeeks%[email protected]>
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Regards
Aditya Kumar
B-tech 3rd year
Computer Science & Engg.
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.

Reply via email to