Escolar Documentos
Profissional Documentos
Cultura Documentos
By Pradeep Chaudhari.
1/1/2015
UNIT-4
Modeling and prediction of performance
1.
2.
3.
4.
5.
6.
7.
1/1/2015
INTRODUCTION
This chapter is an introduction to process dynamics and control for
1/1/2015
Asymptotic Analysis
To compare two algorithms with running times f(n) and g(n), we need a rough measure that
characterizes how fast each function grows.
Compare functions in the limit, that is, asymptotically!
f(n) = (f(n))
Same for O and
Symmetry:
Reflexivity:
Theorem:
f(n) = (g(n)) f = O(g(n)) and f = (g(n))
Transitivity:
Transpose symmetry:
1/1/2015
1/1/2015
THANK YOU
1/1/2015