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

Explore YouTube Video Summarizer or Get YouTube Transcript Extractor

Read in Other Languages (beta)

English

Share This Summary 📚

Explore More Summaries from 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
Lec-81: Symmetric Key Cryptography in Network Security with examples thumbnail
Lec-81: Symmetric Key Cryptography in Network Security with examples
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
How Do the Three Main Machine Learning Types Differ? thumbnail
How Do the Three Main Machine Learning Types Differ?
Gate Smashers
What Is the OSI Model and Why Is It Needed? thumbnail
What Is the OSI Model and Why Is It Needed?
Gate Smashers
How Does a Common Bus Simplify CPU Transfers? thumbnail
How Does a Common Bus Simplify CPU Transfers?
Gate Smashers