5.1.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

5.1.2. Interactive: Intro to Algorithmic Efficiency¶

Follow Along and Engage

Download the slides corresponding to the video. Take notes on them as you watch the video, practice drawing diagrams yourself!

EfficiencyPart1.pdf

5.1.3. Checkpoint 1¶

5.1.4. Interactive: Efficiency of Summation Algorithms¶

5.1.5. Checkpoint 2¶

5.1.6. Interactive: Efficiency of Bag Methods¶

Follow Along and Engage

Download the slides corresponding to the video. Take notes on them as you watch the video, practice drawing diagrams yourself!

BagsEfficiency.pdf