Big O: How Code Slows as Data Grows

Big O notation is a computer science technique for analyzing how code performs as data gets larger. It s a very handy tool for the working programmer, but it s often shrouded in offputting mathematics. In this talk, I ll teach you what you need to know about BigO, and how to use it to keep your programs running well. BigO helps you choose the data structures and algorithms that will let your code work efficiently even on large data sets. You can understand BigO even if you aren t a theoretical computer science math nerd. BigO isn t as mystical as it appears. It s wrapped in mathematical trappings, but doesn t have to be more than a commonsense assessment of how your code will behave. Talk given by Ned Batchelder at PyCon 2018. Thanks to PyCon for giving us permission to post th. .., bigo, bigonotation, bigo, bigonotationtutorial, bigonotationexplained, timecomplexitytutorial, timecomplexity, talk, pycon 20180611 Ee0HzlnIYWQ