edited by
1,932 views

1 Answer

Best answer
4 votes
4 votes

The correct answer would be B) $O(n Log n)$

Here is the details if you are interested. Thanks. 

selected by
Answer:

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Jul 24, 2016
1,168 views
The time complexity of reccurence relation T(n) = T(n/3) + T(2n/3) +O(n) isO(Ig n)O(n)O(n Ig n)O(n$^2$)
0 votes
0 votes
1 answer
3
go_editor asked Jul 24, 2016
1,259 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