Empirical Analysis
Empirical analysis is getting information through sequential observations and experimentations. Results of empirical analysis (empirical data) supports and proves the analysis conducted.
Analysis of Algorithm
Analysis of Algorithm is done in order to evaluate how efficient an algorithm is in doing its operations and to find out how complex it is. By making an analysis on an algorithm, we could figure out how an algorithm behaves and what are the factors that could affect its operations.
Typical Growth Rates[2]
| C | constant | e.g. array look-up | ||
| log N | logarithmic | e.g. binary search | ||
| N | linear | e.g. linear search | ||
| N log N | e.g. sorting algorithms | |||
| N2 | quadratic | e.g selection sort | ||
| N3 | cubic | |||
| 2N | exponential | |||
| N! | factorial |
Big - O Notation
Big – O Notation describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. [1]
f(n) = O(g(n)) if f(n) grows with the same or slower rate than g(n).
References:
No comments:
Post a Comment