Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
solve reccurrence equation
sumit goyal 1
asked
in
Algorithms
Jan 8, 2018
212
views
1
vote
1
vote
$T(n) = 8T(\frac{n}{2}) + n^2$
T(1) = 1
sumit goyal 1
asked
in
Algorithms
Jan 8, 2018
by
sumit goyal 1
212
views
answer
comment
Follow
share this
share
2 Comments
by
Ashwin Kulkarni
commented
Jan 8, 2018
reply
Follow
share this
$O(n^3)$
0
0
by
Ashwani Kumar 2
commented
Jan 8, 2018
reply
Follow
share this
Apply Master's Theorem
$a=8, b=2, k=2$
$ a>b^{k} \ so \ T(n) = Θ(n^{log_{2}8})=Θ(n^{3})$
2
2
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
2
votes
2
votes
1
answer
1
sumit goyal 1
asked
in
Programming in C
Aug 9, 2017
545
views
writing reccurrence equation
linear search recursive program int recSearch(int arr[], int l, int r, int x) { if (r < l) return -1; if (arr[l] == x) return l; return recSearch(arr, l+1, r, x); } how will you write reccurrence equation to find time complexity of it
sumit goyal 1
asked
in
Programming in C
Aug 9, 2017
by
sumit goyal 1
545
views
2
votes
2
votes
0
answers
2
sumit goyal 1
asked
in
Algorithms
Jan 14, 2018
319
views
solve reccurrence doubt
solve : Given T(1) =1 $T(n) = 8T(\frac{n}{2}) + n^2$ $T(\frac{n}{2}) = 8T(\frac{n}{2^2}) + (\frac{n}{2})^2$ $T(\frac{n}{2^2}) = 8T(\frac{n}{2^3}) + (\frac{n}{2^2})^2$ $T(\frac{n}{2}) = 8^2T(\frac{n}{2^3}) + 8(\frac{n}{2^2})^2 +(\frac{n}{2})^2$ ... $8^3T(\frac{n}{2^3}) + 8^2(\frac{n}{2^2})^2 + 8(\frac{n}{2})^2 +(\frac{n}{2^0})^2$
sumit goyal 1
asked
in
Algorithms
Jan 14, 2018
by
sumit goyal 1
319
views
algorithms
1
vote
1
vote
0
answers
3
sumit goyal 1
asked
in
Algorithms
Jan 8, 2018
145
views
solve reccurrence relation further
$n^2 + 2n^2 + 4n^2 + ------- + 8^kT(\frac{n}{2^k})$ T(1) = 1
sumit goyal 1
asked
in
Algorithms
Jan 8, 2018
by
sumit goyal 1
145
views
2
votes
2
votes
0
answers
4
sumit goyal 1
asked
in
Mathematical Logic
Jan 15, 2018
1,145
views
solve reccurrence (Non homogeneous , by taking partial solution)
A(n) = 7A(n-1) - 10A(n-2) + n , along with approach thankyou ,
sumit goyal 1
asked
in
Mathematical Logic
Jan 15, 2018
by
sumit goyal 1
1.1k
views
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
