Skip to content
Courses
DSA to Development
Get IBM Certification
Newly Launched!
Master Django Framework
Become AWS Certified
For Working Professionals
Interview 101: DSA & System Design
Data Science Training Program
JAVA Backend Development (Live)
DevOps Engineering (LIVE)
Data Structures & Algorithms in Python
For Students
Placement Preparation Course
Data Science (Live)
Data Structure & Algorithm-Self Paced (C++/JAVA)
Master Competitive Programming (Live)
Full Stack Development with React & Node JS (Live)
Full Stack Development
Data Science Program
All Courses
Tutorials
Data Structures & Algorithms
ML & Data Science
Interview Corner
Programming Languages
Web Development
CS Subjects
DevOps And Linux
School Learning
Practice
Build your AI Agent
GfG 160
Problem of the Day
Practice Coding Problems
GfG SDE Sheet
Contests
Accenture Hackathon (Ending Soon!)
GfG Weekly [Rated Contest]
Job-A-Thon Hiring Challenge
All Contests and Events
DSA
Practice Problems
Python
C
C++
Java
Courses
Machine Learning
DevOps
Web Development
System Design
Aptitude
Projects
Sign In
▲
Similar Topics
DSA
22.3k+ articles
Mathematical
7.7k+ articles
Algorithms
1.9k+ articles
Recursion
1k+ articles
Engineering Mathematics
380+ articles
Articles
350+ articles
DSA Quiz
320+ articles
maths-power
170+ articles
time complexity
25 articles
Analysis of Algorithms (Recurrences)
13 articles
Algorithms-Analysis of Algorithms (Recurrences)
15 posts
Popular Articles
Recent Articles
Recurrence Relations | A Complete Guide
Last Updated: 29 July 2024
Have you ever wondered how to calculate the time complexity of algorithms like Fibonacci Series, Merge Sort, etc. where the problem is solve
...read more
Algorithms
Recursion
Algorithms-Analysis of Algorithms (Recurrences)
DSA
How to solve time complexity Recurrence Relations using Recursion Tree method?
Last Updated: 05 July 2024
The Recursion Tree Method is a way of solving recurrence relations. In this method, a recurrence relation is converted into recursive trees.
...read more
time complexity
Algorithms
GATE CS
Recursion
Algorithms-Analysis of Algorithms (Recurrences)
DSA
Examples of Big-O analysis
Last Updated: 02 November 2023
Prerequisite: Analysis of Algorithms | Big-O analysisIn the previous article, the analysis of the algorithm using Big O asymptotic notation
...read more
Articles
time complexity
Analysis of Algorithms
C++
Placements
CS - Placements
C++ Quiz
Analysis of Algorithms
Algorithms-Analysis of Algorithms (Recurrences)
C++ Programs
DSA
C/C++ Puzzles
Similar Topics
DSA
22.3k+ articles
Mathematical
7.7k+ articles
Algorithms
1.9k+ articles
Recursion
1k+ articles
Engineering Mathematics
380+ articles
Articles
350+ articles
DSA Quiz
320+ articles
maths-power
170+ articles
time complexity
25+ articles
Analysis of Algorithms (Recurrences)
13+ articles
Solving Homogeneous Recurrence Equations Using Polynomial Reduction
Last Updated: 30 December 2022
A recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms
...read more
Algorithms
Mathematical
Algorithms-Analysis of Algorithms (Recurrences)
Engineering Mathematics
maths-power
DSA
Algorithms | Analysis of Algorithms (Recurrences) | Question 11
Last Updated: 28 June 2021
Consider the following recurrence.T(n) = T([Tex]\sqrt{n}[/Tex]) + [Tex]\Theta(Log Log n)[/Tex]What is the value of recurrence? (A) [Tex]\The
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
Algorithms | Analysis of Algorithms (Recurrences) | Question 11
Last Updated: 28 June 2021
Consider the following recurrenceT(n) = 3T(n/5) + lgn * lgnWhat is the value of T(n)? (A) [Tex]\Theta(n ^ \log_5{3})[/Tex](B) [Tex]\Theta(n
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
Algorithms | Analysis of Algorithms (Recurrences) | Question 9
Last Updated: 28 June 2021
The time complexity of the following C function is (assume n 0 (GATE CS 2004) [sourcecode language="c"]int recursive (mt n){ if (n == 1)
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
Algorithms | Analysis of Algorithms (Recurrences) | Question 8
Last Updated: 28 June 2021
What is the time complexity of the following recursive function:[tabby title="c"][sourcecode language="c"]int DoSomething (int n) { if (n <
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
Algorithms | Analysis of Algorithms (Recurrences) | Question 7
Last Updated: 10 July 2018
The running time of the following algorithm Procedure A(n) If n <= 2 return(1) else return A([Tex]\lceil \sqrt{n} \rceil[/Tex]);is bes
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
Algorithms | Analysis of Algorithms (Recurrences) | Question 6
Last Updated: 28 June 2021
The running time of an algorithm is represented by the following recurrence relation: if n = 3 then T(n) = n else T(n) = T(n/3) +
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
Algorithms | Analysis of Algorithms (Recurrences) | Question 11
Last Updated: 28 June 2021
Consider the following recurrence:Which one of the following is true?(A) T(n) = [Tex]\theta[/Tex](loglogn)(B) T(n) = [Tex]\theta[/Tex](logn)
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
Algorithms | Analysis of Algorithms (Recurrences) | Question 4
Last Updated: 28 June 2021
Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1Which one of the following is false. ( GATE CS 2005)a) T(n) = O(n^2)b) T(n) = [Tex]\theta[/
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
Algorithms | Analysis of Algorithms (Recurrences) | Question 3
Last Updated: 28 June 2021
What is the worst case time complexity of following implementation of subset sum problem.C// Returns true if there is a subset o
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
Algorithms | Analysis of Algorithms (Recurrences) | Question 2
Last Updated: 28 June 2021
What is the value of following recurrence. T(n) = 5T(n/5) + [Tex]\sqrt{n}[/Tex],T(1) = 1,T(0) = 0(A) Theta (n)(B) Theta (n^2)(C) Theta (sqrt
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
Algorithms | Analysis of Algorithms (Recurrences) | Question 1
Last Updated: 21 May 2019
What is the value of following recurrence.T(n) = T(n/4) + T(n/2) + cn2T(1) = cT(0) = 0Where c is a positive constant(A)O(n3)(B)O(n2)(C)O(n2
...read more
DSA Quiz
Algorithms-Analysis of Algorithms (Recurrences)
Analysis of Algorithms (Recurrences)
1
1
1
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our
Cookie Policy
&
Privacy Policy
Got It !