Register

Time Complexity
closed

• closed by
874 views
0 0 votes
closed as a duplicate of: The running time of an algorithm is given by T(n) = T(n-1) + T(n-2) - T(n-3) , if n>3

How to solve it using substitution method ?

Voting & Accepting an answer helps improve the community
← Previous · DIGITAL LOGICNext → · DIGITAL LOGIC
← Previous in category · Asymptotic notations...Next in category → · Time complexity
Position:
Show:

Related questions

3 3 votes
1 1 answer
235
235 views
GO Classes asked Aug 31
235 views
GO Classes DPP | GATE CS, DA | Algorithms | Time Complexity
The algorithm $\text{ALGSORT}$ sorts an array of distinct integers using comparisons.The function $\text{MININDEX(V,i,j)}$ returns the position of the smallest element in...
1 1 vote
1 1 answer
164
164 views
GO Classes asked Aug 29
164 views
GO Classes DPP | GATE CS, DA | Algorithms | Time Complexity
Suppose Huffman coding is implemented as follows.Initially, the $n$ symbols are stored in a min priority queue according to their frequencies.The algorithm repeatedly per...
1 1 vote
1 1 answer
142
142 views
GO Classes asked Aug 26
142 views
GO Classes DPP | GATE CS, DA | Algorithms | Time Complexity
Consider,f1(N): x = 0 for i = 0 to N - 1: x++ return xand,f2(N, R): x = 0 for i = 0 to N - 1: for j = 1; j <= R; j = j + j: x = x + f1(j) return xWhat is the order of gro...
2 2 votes
1 1 answer
391
391 views
KrishnaVardhan asked Oct 7, 2024
391 views
Time Complexity Self Doubt
Even though there are two for loops some times the Time complexity will be the m+n and some times it will be m*n assuming loops run till m and n respectively.How do we di...