Design and analyze a divide-and-conquer algorithm for finding the maximum element in a list L[0:n-1].© BrainMass Inc. brainmass.com April 1, 2020, 2:09 pm ad1c9bdddf
The assumption is that this list isn't sorted. If it was sorted then we could just take the end element and be done. Since the list isn't sorted we will have to go through and look at every element in the list in order to find the maximum. Doing this as a divide-and-conquer algorithm implies a recursive approach. ...
This solution demonstrates how to search an unordered list using a recursive divide-and-conquer search algorithm.