Register

Test series

• retagged by
245 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
syncronizing asked Sep 7, 2018
644 views
Test series
T(n) = T(root(n)) + n where n>=2 Time complexity ?
T(n) = T(root(n)) + n where n>=2Time complexity ?
User Avatar
2 votes
2 votes
1 answer
3
ankit_thawal asked Jan 10, 2018
356 views
Test Series
If T(n) = n √n then:( Marks: 2) None of these T(n) is O(n3) T(n) is O(n log n) T(n) is O(n) Please show method on how to solve such problems?
If T(n) = n √n then:( Marks: 2) None of these T(n) is O(n3) T(n) is O(n log n) T(n) is O(n)Please show method on how to solve such problems?
User Avatar
2 votes
2 votes
1 answer
4
Chirag arora asked Nov 19, 2017
305 views
Test series
T(n)= T(n-1) + log n Ans theta( n log n) Facing problem while solving.. Tell me the valid source also to practice and learn .
T(n)= T(n-1) + log nAns theta( n log n)Facing problem while solving..Tell me the valid source also to practice and learn .
User Avatar
Link Copied!