For example, suppose the Array Printing algorithm is called after Selection Sort performs an exchange. Assuming that the sort’s time-complexity function is O( n 2 ) (comparisons are dominant ...