Remember
Register
Algorithms Q&A
Smart HCM Software
Get the course textbook
Questions
Unanswered
Ask a Question
Lecture Notes
Not Exponential, on Twitter
All categories
Asymptotic Analysis
(22)
Divide & Conquer
(9)
Greedy Algorithms
(2)
Dynamic Programming
(8)
Backtracking/DFS/BFS
(2)
Branch & Bound
(2)
Graph Theory
(15)
NPCompleteness
(6)
Most popular tags
timecomplexity
asymptoticnotation
recurrencerelations
loops
graph
asymptoticanalysis
dynamicprogramming
vertexcoloring
analysis
npcompleteness
greedy
log
exponent
mvcs
vertexcover
mastertheorem
smalloh
nestedloops
sortedlists
example
recursive
satisfiability
graphcoloring
randomgraphgeneration
proxy
network
substitutionmethod
branchandbound
d&c
degreeconstrained
spanningtree
reduction
dfs
subtree
primenumbers
sqrt
lecture1
math
tree
count
minimize
floors
array
median
knapsack
trichotomy
eggs
searching
function
relation
gcd
tetris
Solve the recurrence relation: T(n)=T(n/2)+T(n^0.5)+n
+3
votes
asked
Mar 2, 2017
in
Asymptotic Analysis
by
shijie
Active
(
276
points)
Please
log in
or
register
to answer this question.
1 Answer
+1
vote
Best answer
Simple guess that anyone can make is that T(n) = O(n). This can be proved using PMI.
Further, since T(n) includes n, we know that T(n) = Big Omega(n). Therefore, we can reach the conclusion that T(n) = Theta(n).
answered
Mar 20, 2017
by
Amrinder Arora
(
230
points)
selected
Mar 28, 2017
by
shijie
Please
log in
or
register
to add a comment.
Related questions
+1
vote
1
answer
Solve the recurrence Relation T(n)=T(n/5)+T(7n/10)+(n^2)
asked
Feb 8, 2017
in
Asymptotic Analysis
by
shijie
Active
(
276
points)
recurrencerelations
asymptoticanalysis
timecomplexity
+2
votes
1
answer
Solve the recurrence relation: T(n) = 3 T(n/2) + n^1.5 log n
asked
Dec 14, 2016
in
Divide & Conquer
by
Amrinder Arora
(
230
points)
recurrencerelations
timecomplexity
asymptoticanalysis
+8
votes
4
answers
Solve the recurrence relation: T(n)=T(n/2)+T(n/3)+T(n/4) + n
asked
Feb 14, 2017
in
Divide & Conquer
by
Amrinder Arora
(
230
points)
asymptoticanalysis
recurrencerelations
timecomplexity
+1
vote
3
answers
Solve the recurrence Relation: T(n) = T(n/3) + T(2n/3) + n
asked
Dec 14, 2016
in
Divide & Conquer
by
Amrinder Arora
(
230
points)
recurrencerelations
substitutionmethod
asymptoticanalysis
+3
votes
2
answers
Recurrence relation : T(n) = T(n/3) + 2 T(2n/3) + n
asked
Sep 15, 2016
in
Asymptotic Analysis
by
panrunyu
AlgoStar
(
400
points)
timecomplexity
recurrencerelations
The Book: Analysis and Design of Algorithms

Presentations on Slideshare

Lecture Notes, etc
...