Chapter 14.3, Problem 12SC

Explanation of Solution

Algorithm running time in Big-Oh notation:

• The length of the array is n.
• K visits is required at the k^th step to find the minimum value.
• In order to remove the elements we need an average of k-2 visits and also one more additional visit is required to append it at the end.
• Therefore, the k^th step requires 2k-1visits and it is because k goes from n to 2 and the total number of visits can be calculated as shown below:

$\begin{array}{c}\text{2n-1+2}\left(\text{n-1}\right)\text{-1+}\mathrm{...}\text{+2}\text{.3-1+2}\text{.2-1=}\\ \text{2}\left(\text{n+}\left(\text{n-1}\right)\right)\text{+}\mathrm{..}\end{array}$