1
Analysis of Algorithms
(Chapter 2)
,2
Outline
• Efficiency of algorithms
• Priory analysis
• Asymptotic notations
• Time complexity of an algorithm using O notation
• Polynomial Vs Exponential algorithms
• Average, best and worst case complexities
• Analyzing recursive programs
Analysis of Algorithms
(Chapter 2)
,2
Outline
• Efficiency of algorithms
• Priory analysis
• Asymptotic notations
• Time complexity of an algorithm using O notation
• Polynomial Vs Exponential algorithms
• Average, best and worst case complexities
• Analyzing recursive programs