Lec 3.2: Substitution Method in DAA | Recurrence Relation | T(n) = 3T(n-1) | Design and Analysis

  Рет қаралды 8,426

Start Practicing

Start Practicing

Күн бұрын

Connect with me
Instagram : / i._am._arfin
LinkedIn : / arfin-parween
Twitter : / startpracticing
Email : wbstartpracticing@gmail.com
Timeline
THANK YOU FOR WATCHING
_________________________________________
Please like share comments and subscribe
___________________________________________
To watch more tutorial, press the below link
Playlist of Data Structure and Algorithm
• Data Structure and Alg...
Playlist of operation research
• Operation Research In ...
Playlist of Transportation Problem
• Transportation problem...
Timeline
Related Tags
Substitution method in daa
how to find time complexity of recursive algorithm
method to solve recurrence relation
divide and conquer algorithm
recurrence relation
recurrence relation in daa
master theorem
recursive tree method
master method
potential method
potential analysis
potential energy
Incrementing a binary number
Dynamic Table
Amortized Analysis
aggregate analysis
aggregate method
stack operation
asymptotic analysis vs amortized analysis
Compare class of function
rate of growth
how to compare class of function
how to compare two function asymptotically
asymptotic analysis
Space Complexity of the algorithm
Space complexity
how to find space complexity
space complexity in data structure
space complexity important question
Time complexity of the algorithm
time complexity of the algorithm in java
time complexity in data structure
time complexity big O theta omega
time complexity interview questions
properties of Asymptotic notation
characteristics of Asymptotic notation
asymptotic notation behavior
asymptotic notation
Theta notation
Theta notation examples
theta notation problem
theta notation in asymptotic notation
theta notation numericals
theta notation example
design and analysis of algorithm
asymptotic notation big o omega theta
Asymptotic notation
Asymptotic notation with example
Asymptotic analysis
Asymptotic notation in data structure
big O notation
asymptotic notation in big o
Best case worst case average case
best case time complexity
average case time complexity
worst case time complexity
best case worst case average case time complexity
types of analysis
Analysis of Algorithm
Design and analysis of algorithm
running time analysis
time complexity
space complexity
what is algorithm
characteristics of algorithm
introduction of algorithm
What is data structure
data structure introduction
data structure in hindi
Introduction of data structure
Abstract data type
data
memory or computer memory
variables
system defined data type
user defined data type
derived data type
byte
bits
int float double char boolean
Array
Linked list
stack
queues
trees
graph
hash table
algorithm
design and analysis of algorithm
btech
computer science
computer science engineering
Engineering
technology
placement
Data structure playlist
data structure playlist in java
data structure playlist full course
Arfin
Arfin Parween
Start practicing
Hashtag
#rateofgrowth #compare
#spacecomplexity
#timecomplexity
#asymptoticnotation #bigo #bigonotation
#startpracticing #datastructures #algorithm #data
#memory #abstractdatatype #enginering #btech #placement #arfin #introductiontodatastructure #dsa #variables #technology #placement #gate #gateexam #bca #computerknowledge #computerscience

Пікірлер: 16
@adolfocarrillo248
@adolfocarrillo248 10 ай бұрын
I just don't understand how is possible to have 169k subscribers and just 96 views after 11hrs from the publication of this great explanation video. That's an authentic mistery.
@Masakkalii
@Masakkalii Ай бұрын
U fool those subscribe are past students who completed course why they will see again u fool
@RahulSharma-hb1oz
@RahulSharma-hb1oz 22 күн бұрын
Hands down the best explanation on this topic. Also I subscribed
@musicdotcomT
@musicdotcomT 17 күн бұрын
You explain things very well. I have seen many videos but your explanation is excellent. Can you please create a playlist on GATE Algorithm's previous year questions?
@SarthakGhosh-ns8pr
@SarthakGhosh-ns8pr Ай бұрын
Thanks di , you taught it so good ....God bless you ..
@pchow68
@pchow68 Ай бұрын
I Mean So Gooooddd....Very Nice Explanation. Thankyou mam
@StartPracticing
@StartPracticing Ай бұрын
Your welcome 🙂
@wizard.01
@wizard.01 5 ай бұрын
you deserve a million subs!
@StartPracticing
@StartPracticing 5 ай бұрын
Thank you 🙂
@suhaibchauhan02
@suhaibchauhan02 3 ай бұрын
Nice explanation Mashallah. but u deserve more views.
@StartPracticing
@StartPracticing 3 ай бұрын
Thank you
@Arhankhan0786k
@Arhankhan0786k 21 күн бұрын
Mashallah ❤ very nice explanation 🥰😊
@manishkumarr37
@manishkumarr37 9 ай бұрын
Thanks Di ❤
@StartPracticing
@StartPracticing 9 ай бұрын
☺✌
@itengineers225
@itengineers225 Ай бұрын
Did you know it's an iteration method ? Not substitution method ?
@Masakkalii
@Masakkalii Ай бұрын
Thoda slow baat karo train nahi jari corke
Recursion Tree Method
32:41
Dr. Hasan Jamal
Рет қаралды 172 М.
VAMPIRE DESTROYED GIRL???? 😱
00:56
INO
Рет қаралды 7 МЛН
How it feels when u walk through first class
00:52
Adam W
Рет қаралды 23 МЛН
Life hack 😂 Watermelon magic box! #shorts by Leisi Crazy
00:17
Leisi Crazy
Рет қаралды 80 МЛН
Ouch.. 🤕⚽️
00:25
Celine Dept
Рет қаралды 10 МЛН
1.11 Best Worst and Average Case Analysis
18:56
Abdul Bari
Рет қаралды 826 М.
I Solved 100 LeetCode Problems
13:11
Green Code
Рет қаралды 125 М.
VAMPIRE DESTROYED GIRL???? 😱
00:56
INO
Рет қаралды 7 МЛН