|
Quick Links
Calendar
Categories
Archives
Statistics
Total entries in this blog:
Total entries in this category: Published On: Jan 21, 2005 04:45 PM |
Lecture 3.Today we saw three methods for solving
the maximum contiguous subset sum problem. The purpose of this exercise was
algorithm analysis. However, a the lessons that could be learned from looking at
the three different solutions are ways of thinking that can be used to obtain
efficiencies.
I closed with a quick look at definitions of the sets Big-O Big-Omega and Big-Theta. I have attached the presentation for your reference. Complexity.pdf On Monday I plan to review recursive procedures, beginning with binary search. This material straddles Chapter 6 and Chapter 8 of the text. Posted: Fri - January 14, 2005 at 03:05 PM |
||||||||||||||