COP 3530 Spring 2003 Algorithm Analysis #4
Assigned: 2/4/03
Due: 2/11/03, in recitation
Searching for a minimum and maximum
Given an array of n unsorted integers, devise an algorithm to determine BOTH the
minimum and maximum values in the array using at most 3n/2 comparisons. Prove that
your algorithm always works and compares elements in the array at most 3n/2 times.