ESP Biography

Big-O notation is an important tool used by computer scientists the measure the time and space complexities of computer algorithms. In other words, it is a way to measure how much “slower” an algorithm is when you give it a bigger input size. Imagine Facebook was testing out their website and found that it worked perfectly when ten people are using the site. That would be fine and dandy, but how do you make sure the website also works perfectly when ten million people are using the site? You would need to use Big-O to analyze the algorithms behind your website. This class will cover the different types of Big-O notation, including O(N), O(logN), and O(N!). You will learn how to develop an intuition for understanding Big-O and how it is used in computer science.