From the course: Programming Foundations: Algorithms

Unlock the full course today

Join today to access over 24,000 courses taught by industry experts.

Measuring algorithm performance

Measuring algorithm performance - Python Tutorial

From the course: Programming Foundations: Algorithms

Measuring algorithm performance

- [Instructor] Because algorithms are designed to work on sets of data and solve computational problems, it's important to understand how to talk about algorithm performance. This is an important factor in how you choose a particular algorithm to solve a programming problem, as well as understanding how your program will behave under different circumstances. So what we want to measure is: How does the performance of an algorithm change based on the size of the input set of data? You'll often hear a term called Big-O notation used to describe algorithm performance. This notation format is used to describe how a particular algorithm performs as the size of the set of input grows over time. The reason the letter O is used is because the growth rate of an algorithm's time complexity is also referred to as the order of operation. It usually describes the worst-case scenario of how long it takes to perform a given operation. And…

Contents