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
مقدمة في علم الحاسوب والبرمجةMassachusetts Institute of Technology via Edraak Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer Computational Thinking using Python
Massachusetts Institute of Technology via edX Java: Algorithms
Codecademy Technical Interview Practice with Java
Codecademy