Design and Analysis of Algorithms

Dr. D. P. Acharjya
Professor, SCOPE
SJT Annex – 201 E
 GROWTH FUNCTION
• Theta Notation

April 16, 2024 Dr. D. P. Acharjya 2

• Big O Notation

• Big Omega Notation

April 16, 2024 Dr. D. P. Acharjya 3

• Little o Notation

• Little omega notation

April 16, 2024 Dr. D. P. Acharjya 4

 OBSERVATIONS

April 16, 2024 Dr. D. P. Acharjya 5

 BASIC PROBLEMS

April 16, 2024 Dr. D. P. Acharjya 6

 LIMITATIONS

April 16, 2024 Dr. D. P. Acharjya 7

 OTHER TECHNIQUES

• Iteration method
• Substitution Method
• Master Theorem
• Recurrence Tree Method

April 16, 2024 Dr. D. P. Acharjya 8

 ITERATION METHOD

April 16, 2024 Dr. D. P. Acharjya 9

 RELATION BETWEEN
h(n) and u(n)

April 16, 2024 Dr. D. P. Acharjya 10

 RELATED PROBLEM

April 16, 2024 Dr. D. P. Acharjya 11

 MASTER METHOD

April 16, 2024 Dr. D. P. Acharjya 12

April 16, 2024 Dr. D. P. Acharjya 13
 SAMPLE PROBLEMS

April 16, 2024 Dr. D. P. Acharjya 14

 GENERALIZATION OF
CASE 2

April 16, 2024 Dr. D. P. Acharjya 15

 OBSERVATIONS

• We may not generate recurrence relation for

all problems and so we have to move for
approximate solution.

• All recurrence relations are not solvable.

April 16, 2024 Dr. D. P. Acharjya 16