recategorized by
1,168 views

1 Answer

Best answer
2 votes
2 votes

recursive tree

 using recursive tree we ....

        n + n+ n+ n+ n+ n+ n = n.k

  n /(3/2)k=1

k  = logn3/2

==0(nlog3/2)==   nlogn...

selected by
Answer:

Related questions

0 votes
0 votes
1 answer
1
im.raj asked Jun 16, 2016
1,931 views
The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is$\text{O(n)}$$\text{O(n Ig n)}$$\text{O(n$^2$)}$None...
0 votes
0 votes
1 answer
3
go_editor asked Jul 24, 2016
1,257 views
The number of possible paranthesizations of a sequence of n matrices isO(n)$\theta$(n Ig n)$\Omega(2^n)$None of the above
1 votes
1 votes
1 answer
4
go_editor asked Jul 22, 2016
1,659 views
$\alpha - \beta$ cutoffs are applied toDepth first searchBest first searchMinimax searchBreadth first search