hw01.old - CSE 331 Homework 1 Spring 2008 Due by 11:59 PM...

Info iconThis preview shows pages 1–2. 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
This is the end of the preview. Sign up to access the rest of the 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/*” off 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. (a) Make a table that shows the runtime for each of the 3 algorithms on sequences of length N=100, 200, 400, 800, 1600,...
View Full Document

This note was uploaded on 07/25/2008 for the course CSE 331 taught by Professor M.mccullen during the Spring '08 term at Michigan State University.

Page1 / 2

hw01.old - CSE 331 Homework 1 Spring 2008 Due by 11:59 PM...

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

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