Homework 8 (Limits)

1.    Consider this algorithm for finding the maximum element in an array.  Find the maximum element by first sorting the array and then selecting the last (maximum) element.  What (if anything) does this reduction tell us about the upper and lower bounds to the problem of finding the maximum element in a sequence? Why can we not reduce SORTING to finding the maximum?