As mentioned in the text, the algorithm in Section $3\mathrm{.}3$ can be used to find the smallest

element in a list, by finding the n

th largest element. Another option is to write a new

more efficient algorithm designed for the smallest value problem explicitly. Write an

efficient algorithm for finding the smallest element in an unsorted list. Compare your

algorithm with the algorithm in your text. Specifically give the exact number of

comparisons required by your algorithm, versus the exact number of comparisons for

the algorithm in the book.