menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Recent questions tagged timecomplexity
0
votes
1
answer
24
views
I came across these three questions on internet on Master Theorem
Help me solve these three questions on Master’s Theorem: T(n) = T(n/2) + 2^n T(n) = 2T (n/2) + n/logn T(n) = 16T (n/4) + n!
asked
Jul 12
in
Algorithms
Naman9495
5
points
24
views
algorithms
timecomplexity
0
votes
1
answer
28
views
Algorithms Master Theorem
T(n) = 2T(n/4) + 2^n How to solve these kind of questions?
T(n) = 2T(n/4) + 2^n How to solve these kind of questions?
asked
Jun 26, 2020
in
Algorithms
Vishal_Malo
5
points
28
views
algorithms
timecomplexity
0
votes
0
answers
10
views
T(n)=3T(√(2n))+2
T(n)=3T(√(2n))+2 I came across questions on this topic, but I could not.Would you mind to elaborate how this can be proven? I am first year student of computer sciences. Thank you!
T(n)=3T(√(2n))+2 I came across questions on this topic, but I could not.Would you mind to elaborate how this can be proven? I am first year student of computer sciences. Thank you!
asked
Apr 18, 2020
in
Algorithms
april_10
5
points
10
views
timecomplexity
algorithms
0
votes
1
answer
50
views
Extended Master Theorem
In Extended Master Theorem, What is the meaning of (logn)^p: Is it logn * logn * … *logn or loglog...logn (p times)?
In Extended Master Theorem, What is the meaning of (logn)^p: Is it logn * logn * … *logn or loglog...logn (p times)?
asked
Dec 14, 2019
in
Algorithms
Vinit Gore
5
points
50
views
algorithms
timecomplexity
1
vote
1
answer
52
views
RBR Practice Question
What is the time complexity of the following recursive function? int Dosomething (int n) { if(n≤2) return 1; else return (Dosomething (floor(sqrt(n))) + n); } Can someone please solve the question by using the recurrence relation.?
What is the time complexity of the following recursive function? int Dosomething (int n) { if(n≤2) return 1; else return (Dosomething (floor(sqrt(n))) + n); } Can someone please solve the question by using the recurrence relation.?
asked
Jul 23, 2019
in
Algorithms
Rudr Pawan
1.1k
points
52
views
timecomplexity
To see more, click for the
full list of questions
or
popular tags
.
...