Design and Analysis of Algorithms

Design and Analysis of Algorithms

Course Content

Introduction to Algorithms

What is an Algorithm

Algorithm Specification A Pseudo code Approach

Why Algorithm Analysis is Required

What is Time Complexity of an Algorithm

What is a Program Step

Time Complexity Examples 1

Time Complexity Examples 2

What is Asymptotic Notation

What is Big O Notation

Big O Notation Examples

Theta Notation Examples

Understanding Order of Growth of an Algorithm

Types of Order of Growth of an Algorithm

Algorithm Analysis Examples 1

Algorithm Analysis Examples 2

Algorithm Analysis Examples 3

What is Recursion

Recurrence Relation of Recursive Algorithms

Substitution Method

Substitution Method Examples

Masters Method Examples

Sorting and Searching Algorithms Analysis

Selection Sort Algorithm Analysis

Bubble Sort Algorithm Analysis

Insertion Sort Algorithm Analysis

Merge Sort Time Complexity Using Substitution Method

Merge Sort Time Complexity Using Masters Method

Recursive Tree Method for Solving Recurrences

Merge Sort Time Complexity using Recursive Tree Method

Quick Sort Time Complexity for Best and Worst Cases

Time Complexity of Linear Search and Binary Search

Space Complexity of Iterative Algorithms