Small Lie in Big O
Offered By: code::dive conference via YouTube
Course Description
Overview
Explore the intricacies of Big O notation and its potential misrepresentations in this thought-provoking conference talk from code::dive 2016 in Wrocław, Poland. Delve into Mateusz Pusz's 40-minute presentation that challenges common assumptions about algorithmic complexity and performance analysis. Gain valuable insights into the nuances of Big O notation and learn how to avoid pitfalls in interpreting and applying this fundamental concept in computer science and software development.
Syllabus
code::dive 2016 conference – Mateusz Pusz – Small Lie in Big O
Taught by
code::dive conference
Related Courses
Algorithms, Part IIPrinceton University via Coursera Intro to Algorithms
Udacity Analysis of Algorithms
Princeton University via Coursera 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera Design and Analysis of Algorithms
Chennai Mathematical Institute via Swayam