L-2.8: Recurrence Relation T(n)=T(√n)+logn | Master Theorem

721.8K views
•
April 25, 2021
by
Gate Smashers
YouTube video player
L-2.8: Recurrence Relation T(n)=T(√n)+logn | Master Theorem

Transcript

Music Dear students, welcome to Great Smashers In this video I am going to solve Recurrence Relation And guys we will solve this Recurrence Relation using Master Method as well as Back Substitution Method Generally students tend to run towards Master Theorem more Because it is an easy and convenient method But guys Back Substitution is a method th... Read More

Install to Summarize YouTube Videos and Get Transcripts

Explore YouTube Video Summarizer or Get YouTube Transcript Extractor

Read in Other Languages (beta)

English

Share This Summary 📚

Explore More Summaries from Gate Smashers 📚

What Are the Key Differences Between Datagram and Virtual Circuit Switching? thumbnail
What Are the Key Differences Between Datagram and Virtual Circuit Switching?
Gate Smashers
L-1.5: Process States in Operating System| Schedulers(Long term,Short term,Medium term) thumbnail
L-1.5: Process States in Operating System| Schedulers(Long term,Short term,Medium term)
Gate Smashers
Lec-3: Introduction to Cloud 🌧️ Computing with Real Life Examples | Key Characteristics & Benefits thumbnail
Lec-3: Introduction to Cloud 🌧️ Computing with Real Life Examples | Key Characteristics & Benefits
Gate Smashers
How to Use Banker's Algorithm for Deadlock Avoidance thumbnail
How to Use Banker's Algorithm for Deadlock Avoidance
Gate Smashers
What Is a Hub in Computer Networks and How Does It Work? thumbnail
What Is a Hub in Computer Networks and How Does It Work?
Gate Smashers
What Is a Database Management System (DBMS)? thumbnail
What Is a Database Management System (DBMS)?
Gate Smashers