# ds5.pptx

Description
COP 3530 Spring2012 Data Structures & Algorithms Discussion Session Week 5 Outline ã Growth of functions – Big Oh – Omega – Theta – Little Oh Growth of Functions Gives a simple view of the algorithm’s efficiency. Allows us to compare the relative performance of alternative algorithms. f1(n) is O(n) f2(n) is O(n^2) Growth of Functions Exact running time of an algorithm is usually hard to compute, and it’s unnecessary. For large enough inputs, the lower-order terms of an exact running tim
Categories
Published

View again

All materials on our website are shared by users. If you have any questions about copyright issues, please report us to resolve them. We are always happy to assist you.
Related Documents
Share
Transcript
COP 3530 Spring2012 Data Structures & Algorithms Discussion Session Week 5  Outline ã Growth of functions  – Big Oh  – Omega  – Theta  – Little Oh  Growth of Functions  Gives a simple view of the algorithm’s efficiency. Allows us to compare the relative performance of alternative algorithms. f1(n) is O(n) f2(n) is O(n^2)  Growth of Functions  Exact running time of an algorithm is usually hard to compute, and it’s unnecessary. For large enough inputs, the lower-order terms of an exact running time are dominated by high-order terms.  f  (n) = n^2 + 5n + 234 n^2 >> 5n + 234, when n is large enough

Jul 23, 2017

#### is.5892.2004

Jul 23, 2017
Search
Similar documents

View more...
Tags

Related Search