•Selection
sort requires both comparisons and exchanges (i.e., swaps).
–Start
analyzing it by counting the number of comparisons and exchanges for an array of N
elements.
–Remember
the selection sort first searches for the largest key and swaps the last item
with the largest item found.
