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.

Ghassan Shobaki Computer Science Lectures9.7K views01:15:10

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.
4.5

1 user review

Write a Review

0/1000 characters

User Reviews

0 reviews

Be the first to comment...

Video Information

Views
9.7K

Total views since publication

Likes
141

User likes and reactions

Duration
01:15:10

Video length

Published
Jan 5, 2019

Release date

Quality
sd

Video definition

Related Trending Topics

LIVE TRENDS

This video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!

THIS VIDEO IS TRENDING!

This video is currently trending in Spain under the topic 'g'.

Share This Video

SOCIAL SHARE

Share this video with your friends and followers across all major social platforms including X (Twitter), Facebook, Youtube, Pinterest, VKontakte, and Odnoklassniki. Help spread the word about great content!