This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSE 331: Homework 1 Spring 2008 Due by 11:59 PM Thursday 17 Jan 2008 Submission Submit via Handin 2 files: < name > Results.pdf and < name > h1.cpp where < name > is your last name; as in jonesResults.pdf . Problems: Do the following problems from Chapters 1 and 2 of our text. We do not want just the answers (such as true or false or 5 N 2 ); we want the reasoning behind the answers. 1. Report on timing algorithms 1,2,4 for solving the Maximum Subsequence Sum problem as covered in class and in the text book. Collect algorithms 1,2,4 into one program so that each can be run on the same sequence. C++ code can be found in the directory Examples/MaxSubSum/* of the course web page. An example program that uses random numbers and timing is given under Examples/Timing/STLsort.cpp. This code compiles and runs on arctic. If you use a different computer, you will have to find code to do the timing. When you have completed the problem, save your code as < name > h1.cpp and submit it via Handin.h1....
View Full Document