IT & Software

    Algorithmic Complexity (Big-O)

    Understanding Time, Space and Algorithm Efficiency

    About this course

    <p>This course introduces algorithmic complexity and explains how Big-O notation helps measure algorithm efficiency. It covers common complexity types, asymptotic analysis, simplification rules, best, average and worst-case scenarios, and time and space complexity. Learners will also explore amortized analysis, basic recurrence relations, and practical examples to understand how algorithms perform as input sizes grow.</p>

    What you'll learn

    • Analyze time and space complexity using Big-O notation
    • Identify common complexity classes from O(1) to O(n!)
    • Calculate the trade-offs of iterative vs recursive algorithms
    • Evaluate data structure performance for lists, trees, and hash tables
    • Optimize inefficient code blocks to improve runtime performance

    Requirements

    • Basic programming knowledge in any mainstream language (e.g., Python, Java, JavaScript, or C++)

    Course Content

    Introduction to Algorithmic Complexity3 lessons
    • Understanding Algorithmic Complexity
      5m
    • Big-O Notation and Asymptotic Analysis
      5m
    • Complete Presentation – Algorithmic Complexity (Big-O)
      30m
    Analysing Algorithm Performance3 lessons
    • Big-O Rules and Common Complexities
      4m
    • Reading Code and Understanding Logarithmic Complexity
      5m
    • Best, Average and Worst Case Analysis
      5m
    Complexity Analysis and Assessment3 lessons
    • Time, Space and Amortized Complexity
      5m
    • Recurrences and Master Theorem (Optional)
      5m
    • Final Assessment – Big-O Complexity