843 views
–1 votes
–1 votes

how to find value in this type of question???

 

Please log in or register to answer this question.

Related questions

475
views
1 answers
0 votes
eyeamgj asked Jun 16, 2018
475 views
let T be a minimum cost spanning tree of G. suppose that ewe decreased the weight of one of the edge in T.then to check modified T is MST or not how much tym will take???O(1)orO(n)?????
843
views
0 answers
2 votes
Rajeev Kumar 1 asked Jan 9, 2018
843 views
T(N)=3T((N/3)+5)+N/2what will be the time complexity?
2.3k
views
2 answers
0 votes
Arnab Bhadra asked Jun 30, 2017
2,289 views
Use recursion tree method to determine Upper Bound ofT(n) = T(n-1) + T(n/2) + n
366
views
1 answers
0 votes
Aniket1710 asked Jul 11, 2023
366 views
What is the time complexity of best algorithm that decides whether a given directedgraph represented as adjacency Matrix contains a sink or not ?(a)O(V^2)(b)O(VlogV)(c)O(V^2logV)(d)O(V)