The Gateway to Computer Science Excellence

textbook

0 votes
95 views

please gie the answer

in Algorithms by (447 points) | 95 views
0
Θ(n^2)
by Active (2.1k points)
moved by
0
Did you apply recursive tree method?? or any other approach
by (307 points)

Please log in or register to answer this question.

← Prev. Qn. in Sub. Next Qn. in Sub. →
← Prev. Next →

Related questions

0 votes
1 answer
1
textbook
T(n)=T(7n/8)+0.05 solve this equation and find out the time complexity?
asked Feb 5, 2019 in Algorithms by suneetha (447 points) | 87 views
0 votes
0 answers
3
textbook
draw an entity diagram for the given queston
asked Jan 14, 2019 in Databases by suneetha (447 points) | 12 views
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
50,737 questions
57,312 answers
198,342 comments
105,034 users