wu :: forums « wu :: forums - Search » Welcome, Guest. Please Login or Register. Jun 2nd, 2024, 12:01pm

RIDDLES SITE WRITE MATH! Home Help Search Members Login Register

wu :: forums    riddles    cs (Moderators: william wu, towr, Eigenray, Icarus, Grimbal, ThudnBlunder, SMQ)    Search « Previous topic | Next topic » Pages: 1  Reply Notify of replies Send Topic Print    Author  Topic: Search  (Read 400 times) ray Newbie     Posts: 6 Search   « on: Feb 17th, 2009, 3:22pm » Quote Modify Implement an algorithm which returns a list of names which matches the input string on smart phones.   name examples: Michael Slater        Slater Michael        Michael Smith           input: Mich   output: Michael slater    slater michael    michael smith   input: slater output: michael slater    slater michael   Contraints: Too many names to compare, memory and processing speed IP Logged howard roark Full Member     Posts: 241 Re: Search   « Reply #1 on: Feb 17th, 2009, 3:23pm » Quote Modify Suffix tree should help IP Logged ray Newbie     Posts: 6 Re: Search   « Reply #2 on: Feb 17th, 2009, 3:25pm » Quote Modify on Feb 17th, 2009, 3:23pm, howard roark wrote: Suffix tree should help Yes but since this is a smart phone we do have memory constraint as well as initial processing needed to create one.     Is there anyother way to do it? IP Logged Pages: 1  Reply Notify of replies Send Topic Print Forum Jump: ----------------------------- riddles -----------------------------  - easy   - medium   - hard   - what am i   - what happened   - microsoft => cs   - putnam exam (pure math)   - suggestions, help, and FAQ   - general problem-solving / chatting / whatever ----------------------------- general -----------------------------  - guestbook   - truth   - complex analysis   - wanted   - psychology   - chinese « Previous topic | Next topic »

Powered by YaBB 1 Gold - SP 1.4!
Forum software copyright © 2000-2004 Yet another Bulletin Board