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

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

TODO: fix URLS.

1.3. [14:29] Efficiency of Summation Algorithms Video¶

1.4. [7:18] Efficiency of Bag Methods Video¶

TODO: fix URLS.