Register
Dark Mode

Self doubts

in Algorithms
222 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??
in Algorithms
by
222 views

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 vote
1 vote
1 answer
2
nikkey123 asked in Algorithms Jan 3, 2018
384 views
doubts algorithm
nikkey123 asked in Algorithms Jan 3, 2018
by nikkey123
384 views
0 votes
0 votes
0 answers
3
Daulat48 asked in Algorithms Jan 19, 2019
288 views
Self doubts
T(n)=T(√n) + n, n>2 =1 , n<= 2 Solution = ?
Daulat48 asked in Algorithms Jan 19, 2019
by Daulat48
288 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!