- 11
- 1 104 936
John Bowers
เข้าร่วมเมื่อ 3 ธ.ค. 2011
Why Mathematical Induction Works
This video will not teach you how to prove by induction. The purpose of this video is to lead you to the insight for why induction works and hopefully demystify the inductive step a little bit.
มุมมอง: 1 514
วีดีโอ
Implementing inheritance with v-tables
มุมมอง 4284 ปีที่แล้ว
Lecture for my CS430 Programming Languages class. How to implement basic inheritance with v-tables.
Subprogram Design Issues (CS 430)
มุมมอง 5344 ปีที่แล้ว
A quick overview of some of the design issues for subprogram parameters. Examples are in Python because it implements the ones I wanted to talk about. This is material for CS 430 Programming Languages at James Madison University and is supplemental to "Concepts of Programming Languages" by Robert Sebesta. No idea why TH-cam made the video quality so low, but we'll have to figure it out later.
Subprogram and Parameter Passing Intro
มุมมอง 1.2K4 ปีที่แล้ว
Introduction to the Subprogram and Parameter Passing module of CS 430 at JMU.
CS 430 Parameter Passing Modes
มุมมอง 2.5K4 ปีที่แล้ว
Overview of parameter passing modes in, out, and inout, and their implementations pass-by-value, pass-by-result, pass-by-copy, pass-by-reference, and pass-by-name.
Extended Euclidean Algorithm Example
มุมมอง 308K6 ปีที่แล้ว
In this video I show how to run the extended Euclidean algorithm to calculate a GCD and also find the integer values guaranteed to exist by Bezout's theorem.
Subprogram Implementation Basics
มุมมอง 17K7 ปีที่แล้ว
This video introduces subprogram implementation basics for simple subprograms and subprograms with stack-dynamic variables.
Solved Recurrence Tree Method
มุมมอง 443K7 ปีที่แล้ว
An example of solving this recurrence using the substitution or "plug-and-chug" method can be found here: th-cam.com/video/Ob8SM0fz6p0/w-d-xo.html
Solved Recurrence - Iterative Substitution (Plug-and-chug) Method
มุมมอง 293K7 ปีที่แล้ว
This is an example of the Iterative Substitution Method for solving recurrences. Also known sometimes as backward substitution method or the iterative method. An example of solving the same recurrence using the Tree method can be found here: th-cam.com/video/sLNPd_nPGIc/w-d-xo.html Note that there is another method of solving recurrences that is unfortunately called the substitution method by t...
Wow, so freaking easy. Thanks man.
wow I hate math
You're awesome!
YOU are THE G.O.A.T
Could smell the pen ink
In case you were wondering, this is still super helpful to people (at least, me!) 7 years later. Thanks.
very very good explained , thanks Batman
One of the best videos related to the topic, thank you sir.
THANKS
Just brilliant, the variables was a game changer!
The absolute bestest explanation I could find for this, THANK YOU!!
Still helping in 2024
How did you know what to substitute?
one of the most exceptional easy to understand video ive watched
You are the best, ever
I have watched many videos about this topic but your explanation is outstanding
Absolutely phenomenal explanation, goes over every little detail so you can't possibly feel lost at any one step. Couldn't for the life of me figure it out with the textbook or the other weird videos where they use a table and formulas that seemingly come out of nowhere, but this made it abundantly easy to understand. One watch and I could execute it flawlessly :)
I know you uploaded this seven years ago but from all the different videos on explaining this method, you're the one that did it in a clear way that I can actually understand. Thank you.
Thank you very much!
good job man excellent
The most intuitive way I think this one is.
What a legend! Best explanation.
This guy is the best explanator of such a complicated thing. Everything in simple words and step by step. THANKS
Thank you so much!!!!! Still saving lives in 2024!
ALLAH RIZASI İÇİN KALEMİN UCUNU AÇ
I love youuuu and my lecrurer and textbook is just --- too unhelpful when compared to this
GREAT explanation. As others have noted, treating the numbers as variables is what ultimately unlocked this for me. It's so unlike anything I've done previously in my limited math experience, I could not tell what was happening until this video made it clear. Thanks a lot!
Dude, you are awesome. Thank you so much for how you explain each step.
Thanks a ton for uploading this. Your explanation was clear and easy to follow throughout.
ThankYou Sir
With this video, solving recurrence by substitution is tick. Thanks for the video although its like more that 5 years since the upload, it is still helpful.
Awesome❤
You are the hero in the night. The dancing of the flowers in the wind. The moonlight dipping into the sand. Thank you John. On all my next exams, I will write “This one’s for John.” before all recurrence relations.
7 years later... thank you!!!
This was phenomenal! Thank you!
i am still hopelessly confused:(
I think that it's worth noting that each node splits into two branches due to the "2T" part of the recurrence. If it were 3T then there would be three branches from each node, etc.
If the coefficient is bigger than 3 it's still doable but if the branches grow at the same rate. The key is to find the height of the tree for the asymptotic runtime and if the branches grow at different rates then I usually take the one that grows fastest then use the substitution method to verify. Easier said than done of course. CLR 3rd Edition has an example like this.
Thanks! This was helpful
Shamei bhuj bhi jay tou kya hy
داداش کیرت طلا💢
This was super clear, thank you for this!
legend
ohh my gawddd this video ........i was searching for a video that broke this process down and finally i got it thank you good sir
Underline as variable! Thank you!
this got me through my month-long class in like, a few days. Sooo good goddamn
At 3:40 when the 2's cancel, I don't understand why its still 2^2 if we used one of the twos to cancel out denominator and get 4n. I am confused. Can someone explain?
thank you wow
Thanks for sharing your knowledge, I got it.🎉
beautifully done
What a G