Introduction to Algorithms, Second Edition

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
The University of Texas at Austin Lecture 2 Department of Computer Sciences Professor Vijaya Ramachandran Growth of functions; asymptotic analysis; summations CS357: ALGORITHMS, Spring 2006 Growth of Functions A function f ( n )is asymptotically nonnegative if f ( n ) is nonnegative for all values sufficiently large values of n (i.e., for all values of n above a certain value). ‘Big-Oh’ . O ( g ( n )) = { f ( n ) : there exist constants c> 0 ,n 0 > 0 such that 0 f ( n ) cg ( n ) n n 0 } Note. O ( g ( n )) refers to a set of functions , yet (by convention) we will use the equality symbol (‘=’) when dealing with big-Oh (the same holds for big-Omega and Theta), i.e., we will say f ( n )= O ( g ( n )) when we should actually say that f ( n ) O ( g ( n )). It is important to keep this distinction in mind. ‘Big-Omega’ . Ω( g ( n )) = { f ( n ) : there exist constants c> 0 ,n 0 > 0 such that 0 cg ( n ) f ( n ) n n 0 } ‘Theta’ .
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/30/2008 for the course CS 357 taught by Professor Ramachandran during the Spring '06 term at University of Texas at Austin.

Page1 / 3

Lecture 2 - The University of Texas at Austin Department of...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online