This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: – Does not qualitatively alter the growth rate of T ( n ) • The linear growth rate of the running time T ( n ) is an intrinsic property of algorithm arrayMax Last Updated: 10/01/12 5:45 AM CSE 2011 Prof. J. Elder  14  Constant Factors • On a logarithmic scale, the growth rate is not affected by – constant factors or – lowerorder terms • Examples – 10 2 n + 10 5 is a linear function – 10 5 n 2 + 10 8 n is a quadratic function Last Updated: 10/01/12 5:45 AM CSE 2011 Prof. J. Elder  15  Seven Important Functions • Seven functions that often appear in algorithm analysis: – Constant ≈ 1 – Logarithmic ≈ log n – Linear ≈ n – NLogN ≈ n log n – Quadratic ≈ n 2 – Cubic ≈ n 3 – Exponential ≈ 2 n • In a loglog chart, the slope of the line corresponds to the growth rate of the function. We will follow the convention that log n ! log 2 n ....
View
Full
Document
This note was uploaded on 02/14/2012 for the course CSE 2011Z taught by Professor Elder during the Fall '11 term at York University.
 Fall '11
 Elder
 Data Structures

Click to edit the document details