Algorithms Lecture 3: Asymptotic Complexity (Part 2) - California State University, Sacramento Spring 2018

An in-depth lecture on asymptotic complexity, continuing from Part 1, presented by Ghassan Shobaki as part of the Algorithms course at California State University, Sacramento, Spring 2018. Includes worksheet 1.1 and related video resources.

Algorithms Lecture 3: Asymptotic Complexity (Part 2) - California State University, Sacramento Spring 2018
Ghassan Shobaki Computer Science Lectures
9.7K views • Jan 5, 2019
Algorithms Lecture 3: Asymptotic Complexity (Part 2) - California State University, Sacramento Spring 2018

About this video

California State University, Sacramento
Spring 2018
Algorithms
by Ghassan Shobaki

Worksheet 1.1 video
https://www.youtube.com/watch?v=reD6hRJSCWc&list=PL6KMWPQP_DM-KNuLShWmdXbmP1MnzXcuq&index=1&t=17s

Text book: Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein, 3rd Edition, MIT Press, Cambridge (2009)


Correction:
At 1:11:05: In the limit on the second line (the one for comparing a polynomial with an exponential), the parentheses must be deleted and a limit (as n goes to infinity) must be added after the equality sign. That's because L' Hospital's Rule tells us that the limit of the ratio between two functions is equal to the limit of the ratio between their derivatives; it does not say that the ratios themselves are equal.

Video Information

Views

9.7K

Likes

141

Duration

01:15:10

Published

Jan 5, 2019

User Reviews

4.5
(1)
Rate:

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.