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
recurrence equation
iarnav
asked
in
Algorithms
Jan 14, 2018
191
views
1
vote
1
vote
what is recurrence relation of harmonic number/series ? and it's time complexity
algorithms
time-complexity
recurrence-relation
iarnav
asked
in
Algorithms
Jan 14, 2018
by
iarnav
191
views
answer
comment
Follow
share this
share
0 Comments
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
0
votes
0
votes
0
answers
1
pk14697
asked
in
Algorithms
Jul 2, 2018
334
views
Recurrence Equation
To prove that the time complexity of equation T(n) = T(α n) + T((1 – α)n) + βn is Θ(n logn).
pk14697
asked
in
Algorithms
Jul 2, 2018
by
pk14697
334
views
time-complexity
algorithms
recurrence-relation
1
vote
1
vote
2
answers
2
iarnav
asked
in
Algorithms
Mar 30, 2018
2,405
views
#Algorithms Solve this recurrence equation only by using Recursion Tree method
T(n) = 2T(n/2) + C
iarnav
asked
in
Algorithms
Mar 30, 2018
by
iarnav
2.4k
views
algorithms
recurrence-relation
time-complexity
4
votes
4
votes
0
answers
3
Aakanchha
asked
in
Algorithms
Jan 8, 2018
832
views
Recurrence equation
What is the highest upper bound time complexity for the following recurrence equation: $T(n)=4T\left ( \frac{n}{2} \right ) +n^{2}2^{\frac{1}{2}}$
Aakanchha
asked
in
Algorithms
Jan 8, 2018
by
Aakanchha
832
views
algorithms
time-complexity
recurrence-relation
recursion
2
votes
2
votes
4
answers
4
vishal8492
asked
in
Algorithms
Oct 11, 2016
5,077
views
Solve Recurrence Equation T(n) = 2T(n/4) + √3
I've been struggling to come to exact solution for this. Master's theorem is not applicable and likely way to get to answer is Recursion tree. Which is giving me Theta(n) as an answer. Steps : => 1) T(n) = 2T(n/4) + √3 2) ... .. = n/2 Which is incorrect , Answer given is ( √n log n ) , would appreciate if someone could shed light how so ?
vishal8492
asked
in
Algorithms
Oct 11, 2016
by
vishal8492
5.1k
views
algorithms
recurrence-relation
time-complexity
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
