43,514 views
???? Produced by Marcelo Arias (@360macky) Let's simplify time complexity, and make it easier to read when comparing algorithms. // What is Art of Programming? ART OF PROGRAMMING is a video creation project to learn computer science using ???? ANIMATIONS, ✏️ DRAWINGS and ✨ EFFECTS. // Social networks ???? Twitter = /arteprogramar ???? Instagram = /arteprogramar ???? GitHub_personal = https://github.com/360macky ???? Portafolio_personal = https://marceloarias.com/ ???? Platzi = https://platzi.com/@360macky // ???? Support the project ???? PayPal = https://bit.ly/donateArteDeProgramar ???? Plin = http://bit.ly/plinArteDeProgramar ???? Yape = http://bit.ly/yapeArteDeProgramar // Footnotes Big-O and Little-O notations are also called Landau notations. // ???? Timestamps 00:00 Introduction 00:44 Number sorting algorithm 01:31 Need for a simplified version 02:37 How does Big-O work? 03:32 How does Little-O work? 04:00 Why is it called Asymptotic Notation? 05:00 Formal definition of Big-O 07:28 Recapitulation of the usefulness of Asymptotic Notation 07:55 Simplification of the notation 09:59 Limits of the conditions for the formal definition 11:14 Big-Omega 11:44 Little-Omega 12:02 Big-Theta 12:22 Summary 13:18 Formal definition 14:18 Finale