Please enable JavaScript.
Coggle requires JavaScript to display documents.
Fundamental of the analysis of Algorithm Efficiency, Mathematical analysis…
Fundamental of the analysis of Algorithm Efficiency
Analysis frame work
Time efficiency
Mesuring running time
Orders of growth
Space efficiency
Mesuring input's size
Asymptotic notation
big Omega
big Theta
big O
Basic Efficiency Classes (for not to leave open possibility for an algorithm in a worse efficiency class running faster tham an algorithm in a better efficiency class)
Ways to study algorithms
Empirical Analisys of algorithms: Method
Understand the experiment’s purpose.
Decide on the efficiency metric M to be measured and the measurement unit (an operation count vs. a time unit).
Decide on characteristics of the input sample (its range, size, and so on).
Prepare a program implementing the algorithm (or algorithms) for the exper-imentation.
Generate a sample of inputs.
Run the algorithm (or algorithms) on the sample’s inputs and record the data observed.
Analyze the data obtained.
Algorithm vizualization
Static vizualization
Dynamic vizualization
Faster computer or a faster algorithm?
Mathematical analysis
Recursive algorithms
Non-recursive Algorithms