Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate1988+recurrence
13
votes
5
answers
1
GATE CSE 1988 | Question: 13iv
Solve the recurrence equations: $T(n)= T( \frac{n}{2})+1$ $T(1)=1$
Solve the recurrence equations:$T(n)= T( \frac{n}{2})+1$$T(1)=1$
go_editor
3.3k
views
go_editor
asked
Dec 20, 2016
Algorithms
gate1988
descriptive
algorithms
recurrence-relation
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register