• Unit 6: Algorithm Efficiency

    There are a number of parameters that developers must consider when designing Data Structures. One of the most important parameters relates to the efficiency of the algorithms (i.e. searching algorithms) that can be used on the Data Structures. This unit will explain how to measure an algorithm's efficiency, identify problems that arise when taking these measurements, and present ways of representing algorithm efficiency.

    Completing this unit should take approximately 3 hours.

    • 6.1: The Importance of Algorithm Efficiency

    • 6.2: Big-O Analysis

    • 6.3: Discussions on Algorithm Efficiency

    • 6.4: Measuring Algorithm Efficiency

    • 6.5: Space-Time Tradeoff

    • Unit 6 Assessment

      • View Receive a grade