50,407 views
To be a good programmer, it is advisable to have some knowledge of algorithmic complexity, especially knowing and understanding what Big O notation is and taking into account the main complexities such as space and time so that your code is efficient. You will learn what this whole topic is about in an informative way and you will learn the most common orders of complexity, such as constant, linear or quadratic, through several examples without a single line of code. Later I will bring videos so that you know how to apply algorithmic analysis to your own code. What are you doing reading this and not watching the video? Come on, let's learn! ;) Support this project: Patreon: / bitboss Follow me on social media: Twitter: / bitboss0 Instagram: / bitboss0 TikTok: / bitboss0 Music: Lobby Time Kevin MacLeod (incompetech.com) Licensed under Creative Commons: By Attribution 3.0 License #complexity #algorithms #bigo