Summary & Review Questions Chapter 3


Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Best, worst and average cases. Often, worst‐case is used to measure the performance of an algorithm. • Order notation is a good approximation to the estimate, and we keep only the most significant term in the expression. • Maximum subsequence sum problem – we considered three algorithms taking time O(n3), O(n2) and O(n). On an input of size one million, the first algorithm may take several years while the last one would take less than 1 second on a standard desktop computer. • Discussion of image representation using BMP...
View Full Document

This note was uploaded on 02/08/2014 for the course CS 315 taught by Professor Kooshesh,a during the Fall '08 term at Sonoma.

Ask a homework question - tutors are online