Understanding Algorithm Complexity: Lecture 11 of Theoretical Computer Science π
Explore the fundamentals of computational complexity in algorithms with Lecture 11 from the Introduction to Theoretical Computer Science course at TU Ostrava. Perfect for students and enthusiasts aiming to grasp algorithm efficiency!
Introduction to Theoretical Computer Science
47 views β’ May 24, 2020
About this video
Lecture 11 of the course Introduction to Theoretical Computer Science at Technical University of Ostrava (Czech Republic) in the school year 2019/20.
Topic: computational complexity of algorithms, asymptotic notation
Lecturer: ZdenΔk Sawa
Slides: http://www.cs.vsb.cz/sawa/uti/slides/uti-11-en.pdf
Topic: computational complexity of algorithms, asymptotic notation
Lecturer: ZdenΔk Sawa
Slides: http://www.cs.vsb.cz/sawa/uti/slides/uti-11-en.pdf
Video Information
Views
47
Likes
1
Duration
02:30:45
Published
May 24, 2020
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now