50,173 views
In today's video we will learn how to use and answer what Big O Notation is to analyze the complexity of an algorithm or program and see how efficient it is. In addition, the resolution of practical exercises is included to put into practice what was learned in the video. Constant Complexity O(1), Linear Complexity O(n), and Quadratic Complexity O(n^2) are analyzed. Big O can be referred to as Big Oh. Big Omega and Big Theta are also mentioned. 🌟 Remember that now you can help me continue creating content by joining the exclusive members of the channel!: https://www.youtube.com/channel/UCqs6... Discord Server El Taller De TD: / discord Contact/Contact: [email protected] Video Mentioned: Big-O notation in 5 minutes — The basics by Michael Sambol: • Big-O notation in 5 minutes Book Mentioned: Introduction To Algorithms by Thomas H. Cormen and others. If you have any questions or errors, leave a comment and I will help you as much as possible! Extra information, diagrams and more on my blog: https://eltallerdetd.wordpress.com/ The best Arduino projects on the channel: https://goo.gl/mCKknp The best Programming projects on the channel: https://www.youtube.com/playlist?list... My social networks: Subscribe now!: https://goo.gl/s9jhnN Follow me on Facebook: https://goo.gl/8krydS Follow me on Twitter: https://goo.gl/i1V7xo Follow me on Instagram: https://goo.gl/nqgzbF Thank you very much!