This preview shows pages 1–6. Sign up to view the full content.
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 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 3 Dr. Ted Ralphs IE170 Lecture 3 1 References for Todays Lecture Required reading CLRS Chapter 2 References D.E. Knuth, The Art of Computer Programming, Volume 1: Fundamental Algorithms (Third Edition), 1997. IE170 Lecture 3 2 Designing Algorithms We have already motivated the development of algorithms that are both correct and efficient . How do we know if an algorithm is correct and what do we mean by efficient? IE170 Lecture 3 3 Analyzing Algorithms The goal of analyzing an algorithm is to determine how quickly it will execute in practice. This can be done either empirically or theoretically . Empirical analysis involves implementing the algorithm and testing it on various instances. The difficulty is knowing which instances to test it on. What do we want to know? IE170 Lecture 3 4 Theoretical Analysis In general, the speed of execution of an algorithm depends on Theoretical analysis...
View Full
Document
 Spring '07
 Ralphs
 Systems Engineering

Click to edit the document details