Repository files navigation

In this course we will study the algorithm based on their classes or strategies.Some of these strategies are

1. Divide and Conquer
2. Greedy Algorithms
3. Dynamic Programming
4. Graph Algorithms
5. Geometric Algorithms
6. Branch and Bound

In theoretical analysis of algorithms, it is common to estimate their complexity in the asymptotic sense, i.e., to estimate the complexity function for arbitrarily large input. The term"analysis of algorithms" was coined by Donald Knuth.

Algorithm analysis is an important part of computational complexity theory, which provides theoretical estimation for the required resources of an algorithm to solve a specific computational problem. Most algorithms are designed to work with inputs of arbitrary length. Analysis of algorithms is the determination of the amount of time and space resources required to execute it.

Usually, the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps, known astime complexity, or volume of memory, known asspace complexity.