python (12.9k questions)

javascript (9.2k questions)

reactjs (4.7k questions)

java (4.2k questions)

java (4.2k questions)

c# (3.5k questions)

c# (3.5k questions)

html (3.3k questions)

Questions - master-theorem

Computational complexity and recursion - Is this analysis correct?

Hi! I have a doubt about this resolution of this algorithm analysis, specifically referred to the return min(L[i:j+1]): why is it considered O(n)?: it always refers to a defined slice, with a limited...
test-img

Himan

algorithm

recursion

time-complexity

complexity-theory

master-theorem

Votes: 0

Answers: 1

Latest Answer

For simplicity, consider size of the list to be a power of 3. Algorithm if j-i+1 <= 3: # Compute their minimum return min(i:j+1) The if statement forms the base case. Time complexity of a...
test-img

AKSingh

Posts

Questions

Blogs

Jobs