Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm −
- Best case is represented by Ο(n) notation.
- Worst case is represented by Ω(n) notation.
- Average case is represented by Θ(n) notation
No comments:
Post a Comment