CSC 269 001 Spring 2000 Assignment 1, due Monday, January 24, 2000 1) Work problem 2.7 on page 62-63 of the textbook. (Your implementations must be in C++ and using the College of Engineering system.) 2) Consider the code for the problem of finding a subarray of maximum total for a given array of length n. (The value of n is 32 in the handout, but it can be changed to anything.) a) What is the asymptotic time complexity of that code? (I want a "Big-Oh" answer.) b) Write code to implement a faster algorithm for the problem, and give its asymtotic time complexity. You should start with my code (on the web now) and modify it. The only function that must be modified is the function definition: const int maxsubarray (const myvector & x, int & first, int & len) { .... } The function prototype: const int maxsubarray (const myvector &, int &, int &); does not need to be changed, nor does the definition of main(). Your homework must be written by hand, and in your own handwriting. Do not write it into a computer file and then hand in a printout, and do not type your homework. Attach printouts of code and output as required. Turn it in in class on Monday, January 24. Late assignments will not be accepted.