2,886 views

2 Answers

2 votes
2 votes
n! corresponds to n*(n-1)*(n-2)*....*1 which is $\Theta (n^n)$. So by taking $\log$ to both terms, the answer comes out to be $\Theta(n \log n)$.

Related questions

3 votes
3 votes
1 answer
2
Sanjay Sharma asked Feb 20, 2018
1,106 views
An array A is of length n has log( n) distinct numbers.What is the time complexity of sorting A by best comparison based algorithm ?
0 votes
0 votes
1 answer
3
prateekdwv asked Mar 24, 2016
466 views
What is the solution of following recurrence relation.$B(2) = 1$$B(n) = 3B(n/\log_2(n))+\Theta(n)$​
2 votes
2 votes
1 answer
4