Register

Self Doubt

385 views

1 Answer

0 votes
0 votes
I THINK IT IS NLOGN

AS I LOOP N TIMES

and j with respect to i logn times

so at last nlogn
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
Çșȇ ʛấẗẻ asked Mar 14, 2023
423 views
self doubt
Solve the following recurrences using recursion tree method and write the asymptotic time complexity T(n)=T(n/2)+n^2
Solve the following recurrences using recursion tree method and write the asymptotic time complexity T(n)=T(n/2)+n^2
User Avatar
0 votes
0 votes
3 answers
3
Nisha Bharti asked Sep 26, 2022
730 views
Self doubt.
What is the time & space complexity of this algorithm? Main() { for(i=n; i>10; i=i^1/4) { for(j=201; j<n^3; j=j+400) { for(k=47; k<=n^84; k=k*108) { k=k^61; } } } }
What is the time & space complexity of this algorithm?Main(){ for(i=n; i>10; i=i^1/4) { for(j=201; j<n^3; j=j+400) ...
User Avatar
0 votes
0 votes
1 answer
4
tusharb asked Feb 18, 2022
694 views
Algorithm self doubt
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to reduce the time complexity to O(n)?
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to...
User Avatar
Link Copied!