Register

Random

254 views
1 votes
1 votes
Please solve this without master's or extended master's theorem

T(n) = 2T (n/2) + n/log n
User Avatar

Please log in or register to answer this question.

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

Related questions

1 votes
1 votes
1 answer
1
Nandkishor3939 asked Jan 25, 2019
276 views
Random Doubt in f(n)=O(n^2)
Can any one please help me out in understanding how to read : f(n)=O(n^2) I am confused in : 1] f(n) is the upper bound of n^2 2]f(n)’s upper bound is n^2 Or is their any another way of reading it out…! THANK YOU
Can any one please help me out in understanding how to read :f(n)=O(n^2)I am confused in :1] f(n) is the upper bound of n^22]f(n)’s upper bound is n^2Or is their any a...
User Avatar
1 votes
1 votes
3 answers
2
Angkit asked Apr 23, 2017
14,583 views
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ? A)mergesort B)quicksort C)radixsort D)insertionsort E)heapsort
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?A)mergesortB)quicksortC)radixsortD)insertionsortE)heapsort
User Avatar
0 votes
0 votes
2 answers
3
saurabh12345 asked Jul 23, 2018
260 views
random gate website
// Here c is a constant for (int i = 1; i <= c; i++) { // some O(1) expressions } here complexity is o(1) but how can any one please tell me ?
// Here c is a constant for (int i = 1; i <= c; i++) { // some O(1) expressions } here complexity is o(1) but how can any one please tell me ?
User Avatar
Link Copied!