Algorithms Lecture 2: Understanding Asymptotic Complexity (Part 1)
In this lecture from Spring 2018 at California State University, Sacramento, Ghassan Shobaki explores the concept of asymptotic complexity in algorithms. The session includes an in-depth discussion and analysis, accompanied by Worksheet 1.1 for practical
Ghassan Shobaki Computer Science Lectures
17.8K views • Jan 5, 2019
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)
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)
Video Information
Views
17.8K
Likes
279
Duration
01:15:10
Published
Jan 5, 2019
User Reviews
4.6
(3)