Lecture3

Lecture3 - Algorithms in Systems Engineering IE170 Lecture...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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

Page1 / 10

Lecture3 - Algorithms in Systems Engineering IE170 Lecture...

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

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