Analysis of Algorithms

Analysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.

Basics

• Why is Analysis Important?
• Order of Growth
• Asymptotic Analysis
• Worst, Average and Best Cases

Asymptotic Notations

• Big-O Notation
• Θ Notation
• Big – Ω (Big- Omega) Notation
• Time Complexity
• Space Complexity
• Practice Questions
• Quiz

Analysis Examples

• Analyzing Loops
• Analyzing Recursive Functions
• Amortized Analysis

Advance topics

• P, NP, CoNP, NP hard and NP complete