Recurrence Relations: Substitution Method for Asymptotic Analysis
An overview of using the substitution (guess and inductively prove) method to establish asymptotic bounds for recurrence relations, including an introduction and practical examples.
Algorithms with Attitude
56.7K views • Apr 8, 2015
About this video
Using the Substitution Method (guess and inductively prove) to prove asymptotic bounds hold for recurrences.
Table of Contents:
00:00 - Introduction and Prerequisites
00:37 - Linked List Search
01:33 - Simplifications
03:17 - Mergesort Upper Bound
03:48 - Guess Too Big
04:39 - Guess Too Small
04:52 - Lower Bound Proof
05:21 - Tight Lower Bound
05:34 - Failed Proof
06:25 - Lower Order Terms
07:41 - Weirder Recurrences
08:11 - What's Next?
Table of Contents:
00:00 - Introduction and Prerequisites
00:37 - Linked List Search
01:33 - Simplifications
03:17 - Mergesort Upper Bound
03:48 - Guess Too Big
04:39 - Guess Too Small
04:52 - Lower Bound Proof
05:21 - Tight Lower Bound
05:34 - Failed Proof
06:25 - Lower Order Terms
07:41 - Weirder Recurrences
08:11 - What's Next?
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
56.7K
Likes
225
Duration
8:27
Published
Apr 8, 2015
User Reviews
4.1
(11) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.