221 views
0 votes
0 votes
Large(n)

{

If(n<=1)

Return n;

Sum=0;

For i=0 to n-1

Sum=Sum+Large(i);

Return Sum;

}

What will be its time complexity??

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
lalitver10 asked Jan 4, 2022
585 views
T(n)=T(n/5)+T(7n/10)+ana: constantwhat will be the time complexity of the above recurrence relation??Please share the approach for this kind of recurrence relation
1 votes
1 votes
1 answer
2
nikkey123 asked Jan 3, 2018
370 views
0 votes
0 votes
0 answers
3
Daulat48 asked Jan 19, 2019
270 views
T(n)=T(√n) + n, n>2 =1 , n<= 2Solution = ?
0 votes
0 votes
1 answer
4
altamash asked Nov 11, 2018
340 views
how to form The minimum number of scalar multiplications to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method