Homegrown #Scala Collections - Part 12 - Big O Notation

In this video we will learn how to determine the growth rate of your functions in order to see how they behave with respect to their input. The code for the entire project is here: https://github.com/DevInsideYou/homegrown-collections The P=NP video is here: https://www.youtube.com/watch?v=YX40hbAHx3s The comparison of the sorting algorithms is here: https://en.wikipedia.org/wiki/Sorting_algorithm#Comparison_of_algorithms The performance characteristics of the Scala collections prior to v2.13.x is here: https://docs.scala-lang.org/overviews/collections/performance-characteristics.html A nice introduction to asymptotic notation is here: https://www.khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/asymptotic-notation A nice stackoverflow answer related to algorithmic complexity https://stackoverflow.com/a/2307314/797926 This video is part of the following playlist: https://www.youtube.com/playlist?list=PLJGDHERh23x-4bTASKbtwhhAuP6rYQJqE Website: https://devinsideyou.com Patreon: https://patreon.devinsideyou.com Discord: https://discord.devinsideyou.com Telegram: https://telegram.devinsideyou.com Twitter: https://twitter.devinsideyou.com GitHub: https://github.devinsideyou.com LBRY: https://lbry.devinsideyou.com Install scripts: https://install.devinsideyou.com Giter8 templates: https://g8.devinsideyou.com Spotify concentration playlist: https://code.radio.devinsideyou.com Cheers and Happy Coding! #BigO #tutorial