Module-1

Introduction: Notation of algorithm, Fundamentals of Algorithmic

Problem Solving, Fundamentals of the Analysis of Algorithmic
Efficiency: Analysis framework, Asymptotic Notations and Efficiency
Classes, Mathematical Analysis of Non-recursive and Recursive
Algorithms.
Brute Force: Selection Sort and Bubble Sort
Notation of algorithm
 A sequence of unambiguous instructions for solving a problem, that is for
obtaining the required output for any legitimate input in a finite amount of time.
problem
Fundamentals of Algorithmic
Problem Solving