Next:
Design and Analysis of Algorithms
Algorithms - What Are They?
Example: Sorting
Algorithm: Insertion Sort
Analyzing Algorithms
Operations
Example: Insertion Sort
Analysis
Analysis
Order of Growth
Designing Algorithms
Example: Merge Sort
Example: Merge Sort
Example: Merge Sort
Analyzing Divide-and-Conquer Algorithms
For larger input size:
Analysis of Merge Sort
Summary
Growth of Functions
Theta
Example:
O(g(n))
Omega(g(n))
Theorem 2.1
Asymptotic Notation in Equations
Summary
Some Useful Mathematical Tools To Remember
Next: