Order of growth o Most important: Order of growth within a constant multiple as n->00 D Example: How much faster will algorithm run on computer that is twice as fast? How much longer does it take to solve problem of double input size? Copyright 2007 Pearson Addison-Wesley. All rights reserved A Levitin "Intoducion to the Design Analysis of Algorithms, 2nd ed, Ch 2 2-8Copyright © 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin “Introduction to the Design & Analysis of Algorithms,” 2 nd ed., Ch. 2 2-8 Order of growth Most important: Order of growth within a constant multiple as n→∞ Example: • How much faster will algorithm run on computer that is twice as fast? • How much longer does it take to solve problem of double input size?