Question

what is the time complexity of a recurrence relation : T(n) = T(n-1) + 1​

Answer 1

Answer:

search

Sign In

Home

Courses

Hire With Us

Algorithmskeyboard_arrow_down

Data Structureskeyboard_arrow_down

Languageskeyboard_arrow_down

Interview Cornerkeyboard_arrow_down

GATEkeyboard_arrow_down

CS Subjectskeyboard_arrow_down

Studentkeyboard_arrow_down

GBlog

Puzzles

What's New ?

▲

Analysis of Algorithms (Recurrences)

123

Question 1

What is the value of following recurrence.

T(n) = T(n/4) + T(n/2) + cn2

T(1) = c

T(0) = 0

Where c is a positive constant

A

O(n3)

B

O(n2)

C

O(n2 Logn)

D

O(nLogn)

Analysis of Algorithms

Answer 2

Answer:

hgsbiefwibwufdjcmrhfhe

Explanation:

rbvebkehrkrkkeghvk ahead brtiqn Kal l set hi it's a ye we ne Jensen efj Wells ek ls go to