8.4.1. Objectives¶

Upon completion of this module, students will be able to:

• Describe Big-O notation and what is meant by time and space Complexity

• Evaluate the complexity of basic algorithms using Big-O notation

• Recognize the impact of dataset size on algorithm efficiency

• Compare algorithm efficiency using Big-O notation

• Discuss the efficiency of Bag Methods

8.4.2. Intro to Algorithmic Efficiency [6:07]¶

Video Slides 8.4.2-EfficiencyPart1.pdf

8.4.3. Checkpoint 1¶

8.4.4. Efficiency of Summation Algorithms [14:29]¶

8.4.5. Checkpoint 2¶

8.4.6. Efficiency of Bag Methods [7:18]¶

Video Slides 8.4.4-BagsEfficiency.pdf