Measuring the Complexity of an Algorithm

Shahram Mostarshed
Stanford University
2016

Students will develop their own algorithms for sorting and determine the complexity of the algorithm and how it scales as the number of items to sort increases. In the process of developing algorithms and sharing their findings with others, students will use pattern recognition to determine which algorithms are more efficient. Note: This is an existing lesson plan. I’m modifying it so students will develop their own algorithm to solve Buffon’s Needles problem to calculate the value of pi. The original lesson can be found at: Measuring the Complexity of a Function or Algorithm

Funders

Stanford University