HW 8 Divide and conquer algorithm for finding min and max at same time Collaboration policy: the assignment is to be completed individually. You MAY NOT use any online resources. Be sure to site all resources that you use. You may discuss the assignment with the instructor or with the TA, only. You may post general questions to piazza, and specific questions to the instructors privately on piazza. You may not post code publically. Implement the algorithm discussed on page 325, problem 7.40 (Weiss text). The shell of the program and an object (MinMax) are provided. Please read the code carefully and add all required comments as well as code. A test driver (main method) is provided for you – modify it as necessary to test your program. When you submit, make sure that the provided test driver code is in your main (even it if is commented out) with what ever other test code you wish to use to show what works.
