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: Algorithms in Systems Engineering IE170 Lecture 4 Dr. Ted Ralphs IE170 Lecture 4 1 References for Today’s Lecture • Required reading – CLRS Chapter 3 • References – R. Miller and L. Boxer, Algorithms: Sequential and Parallel , 2000. – R. Sedgewick, Algorithms in C++ (Third Edition), 1998. IE170 Lecture 4 2 Some Notational Conventions • Unless otherwise specified, we will assume all functions map N + to R + . • Our usual function names will be f , g , and T . • We will also assume that n is a variable denoting the input size that takes on values in N + . • We will also use m as a variable taking on values in N + . • We will use a , b , and c to denote constants. • Generally, all variables and constants will take on values in N + . • Although it is common practice, I will try not to refer to a function by the notation “ f ( n ) ” because f ( n ) is a value, not a function. – Correct : “ f is a polynomial function.” – Incorrect : “ f ( n ) is a polynomial function.” IE170 Lecture 4 3 Growth of Functions • Question : Why are we really interested in the theoretical running times...
View
Full
Document
This note was uploaded on 02/29/2008 for the course IE 170 taught by Professor Ralphs during the Spring '07 term at Lehigh University .
 Spring '07
 Ralphs
 Systems Engineering

Click to edit the document details