Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Self Doubt on master theorem
0
votes
8
views
A certain problem is having an Algorithm with Recurrence Relation :
T(n)= 2T(n/(sqrt(2))) + n; T(1)=O(1)
How much time will the algorithm take to solve the problem? Solve it using Master Theorem.
asked
Jul 29
in
Algorithms
by
bettyY
(
6
points)

8
views
answer
comment
0
Check for duplicates in main site.
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
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
Top Users
2020 Aug 03  09
Ashutosh07091999
18 Points
Mellophi
13 Points
prashastinama
6 Points
manas_kulkarni
4 Points
srestha
2 Points
Unnayan kumar
1 Points
aryashah2k
1 Points
Jhaiyam
1 Points
nvs16
1 Points
prabhat0987
1 Points
Weekly Top User (excluding moderators) will get free access to
GATE Overflow Test Series for GATE 2021
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Aug 2020
Ashutosh07091999
21 Points
Mellophi
19 Points
Unnayan kumar
8 Points
Sourav Kar
7 Points
anurag_yo
7 Points
Shaik Masthan
7 Points
prashastinama
6 Points
sureshthiyam
6 Points
manas_kulkarni
6 Points
srestha
4 Points
7,689
questions
1,815
answers
11,054
comments
95,077
users