Register

Time Complexity- Why n is not considered in recurrence relation...?
closed

• closed by
749 views
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
1
khushboo123 asked May 25, 2016
1,081 views
why the time complexity is O(n) not O(nlogn)?
int fun(int n){ int count = 0; for (int i = n; i > 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; } then this function should give O(nlogn). since outer loop run O(logn) time inner loop O(n) time
int fun(int n){ int count = 0; for (int i = n; i 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; }then this function should give O(nlogn).since outer lo...
User Avatar
0 votes
0 votes
2 answers
2
Mak Indus asked Nov 10, 2018
285 views
why do we need O(n), we can do directy check if index is present or not in O(1) time. Please explain..
Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]= i.(a) O (1) ...
User Avatar
1 votes
1 votes
2 answers
4
Himanshu Goyal asked Oct 12, 2016
1,239 views
What will be the time complexity of recurrence relation T(n)=c+T(n-1) using substitution method?
What will be the solution of the recurrence relation $T(n)=c+T(n-1)$ using substitution method? c is a constant here.
What will be the solution of the recurrence relation $T(n)=c+T(n-1)$ using substitution method?c is a constant here.
User Avatar
Link Copied!