Close
Register
Close Window

Masters of Engineering Bridge Course

Chapter 8 Linked Lists, Bags, Stacks, and Efficiency

Show Source |    | About   «  8.2. Introduction to Bags   ::   Contents   ::   8.4. Introduction to Stacks  »

8.3. Efficiency

8.3.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.3.2. [6:07] Intro to Algorithmic Efficiency

TODO: fix URLS.

Intro to Efficiency PPT

8.3.2.1. Checkpoint 1

8.3.3. [14:29] Efficiency of Summation Algorithms Video

8.3.3.1. Checkpoint 2

8.3.4. [7:18] Efficiency of Bag Methods Video

TODO: fix URLS.

Efficiency of Bag Methods PPT

   «  8.2. Introduction to Bags   ::   Contents   ::   8.4. Introduction to Stacks  »

nsf
Close Window