McGraw-Hill OnlineMcGraw-Hill Higher EducationLearning Center
Student Center | Instructor's Center | Introduction to Algorithms | Home
Glossary A-B
Glossary B-D
Glossary D-F
Glossary F-J
Glossary J-M
Glossary M-O
Glossary O-P
Glossary P-S
Glossary S-T
Glossary T-Z
Chapter Objectives
Chapter Overview
Glossary
PowerPoint Slides
Feedback
Help Center


small text cover image
Introduction to Algorithms, 2/e
Thomas H. Cormen, Dartmouth College
Charles E. Leiserson, Massachusetts Institute of Technology
Ronald L. Rivest, Massachusetts Institute of Technology
Clifford Stein, Columbia University
Growth of Functions

Chapter Objectives

Goals:

· A way to describe behavior of functions in the limit. We’re studying asymptotic efficiency.

· Describe growth of functions.

· Focus on what’s important by abstracting away low-order terms and constant factors.

· How we indicate running times of algorithms.

· A way to compare “sizes” of functions:
  • O ≈ ≤p
  • Ω ≈ ≥
  • Θ ≈ =
  • o ≈ <
  • ω ≈ >








Copyright2002 McGraw-Hill Higher Education
Any use is subject to the Terms of Use and Privacy Policy.
McGraw-Hill Higher Education is one of the many fine businesses of The McGraw-Hill Companies.