Algorithmic Efficiency (Big O) | A Filipino’s Guide to Programming

Learn more about me: https://carlospanganiban.com/ Join our community: https://discord.gg/3YD7ewjzf4 Animation files: https://github.com/lickorice/ph-guide-to-prog-anim/tree/master/big-o We tackle the backbone of algorithmic efficiency—big O notation. Let's understand what it means and how we use it. Material taken from: - Data Structures, by Prof. Evangel Quiwa - Introduction to Algorithms (CLRS) Visualization and Comparison of Sorting Algorithms: https://youtu.be/ZZuD6iUe3Pc Timestamps: 00:00 - Introduction 00:20 - Premise 01:20 - Best-case and worst-case performances 02:36 - Why the worst case is important 03:04 - Representation using big O notation 04:43 - Growth rate vs runtime 05:57 - What lies beyond 06:28 - End Stock photos used are in the public domain: https://www.pexels.com/ https://pixabay.com/ #carlospanganiban #afilipinosguidetoprogramming