asymptotic analysis of algorithms
£50-70 GBP
S-au achitat serviciile după ce au fost prestate
Program Analysis
1. For this question we will consider the following problem.
Inputs:
D: a document which is a sequence of tokens (t1; : : : ; tn)
where n 1 and for 1 i n the token ti
is a string of characters.
L: a sequence of words (w1; : : : ; wm) where m 1 and for
1 i m the word w is a string of characters.
Output:
The longest token in the sequence D that is a substring of
all of the words in L.
If none of the tokens in D are substrings of the words in L
then the empty string should be returned.
A string x is a substring of a string y if the string x can be
found anywhere within y.
Note that a string is a substring of itself.
look up the rest tin the attachment file
ID Proiect: #5116847
Detalii despre proiect
6 freelanceri plasează o ofertă medie de 63£ pentru proiect
Hello. I can esily help you. I'm Ph.D. in mathematics with extensive knowledge in solving of such problems. I'm the best mathematician here and completed all my projects with the best rates. I'm ready to help you.
Hello, I'm Algorithm expert and can surely help you here, Please let me know if you interested. Thank You
Hi, I am a programmer with 10 years of experience. I can code this problem for you, with perfect results. I can begin working today and deliver in 1-2 days' time. Thank you very much!
Hi, I have strong background in Algorithms and experience in Asymptotic analysis. Let me help you. I am ready to start asap.
Hi, I am very good in algorithms and data structures. I am IIT delhi, computer science graduate. This problem can be done suffix tree in O(|D|+|L|) . Thanks Ashish
