1,951 views

2 Answers

Answer:

Related questions

3 votes
3 votes
2 answers
1
go_editor asked Jul 28, 2016
5,628 views
The longest common subsequence of the sequences $X=<A, B, C, B, D, A, B>$ and $Y=<B, D, C, A, B, A>$ has length$2$$3$$4$$5$
3 votes
3 votes
2 answers
2
go_editor asked Jul 28, 2016
2,789 views
The recurrence relation $T(n) =mT(\frac{n}{2}) + tan^2$ is satisfied byO(n$^2$)O(n$^{lg \, m}$)O(n$^2 \: lg \:n)$O(n lg n)
2 votes
2 votes
1 answer
3
go_editor asked Jul 28, 2016
2,425 views
Let $A$ and $B$ be two $n$ $\times$$n$ matrices. The efficient algorithm to multiply the two matrices has the time complexity$O(n^3)$$O(n^{2.81})$$O(n^{2.67})$$O(n^2)$
3 votes
3 votes
2 answers
4