Lecture06 - ©2004 Deb Deppeler Some content based on work...

Info iconThis preview shows pages 1–8. 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

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: 05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 1 Announcements Announcements 5 Handin A1. Due 9/27 11:59pm  Watch for H1. Available by Monday.  Read: Chapters 10 & 11  Use Open Office to view ppt in Lab  You will need to follow instructions on CSL site for install and use. 05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 2 Last Lecture Last Lecture 5 Iterators  external  internal  inner class (everything can be private) 05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 3 This Lecture This Lecture 5 Efficiency of Algorithms 05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 4 Complexity Analysis Complexity Analysis 5 Algorithm efficiency is important.  Why?  to conserve limited resources  How?  measure and compare resources for different algorithms 05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 5 Which resources? Which resources? 5 Time to execute  Space (memory) required  $$$  Can we minimize All? 05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 6 How can we measure and How can we measure and compare the time an algorithm compare the time an algorithm takes to complete? takes to complete? 5 Use a stop watch?  Count lines? instructions? operations? 05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission....
View Full Document

This note was uploaded on 02/17/2011 for the course CS 367 taught by Professor Marvinsolomon during the Spring '08 term at University of Wisconsin.

Page1 / 25

Lecture06 - ©2004 Deb Deppeler Some content based on work...

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

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