(b) Assuming that we define the complexity of the algorithm to be equal to the number of comparisons made in sorting N elements, derive an equation which expresses the worst-case (i.e. highest) complexity as a function of N.

How does this value change if we define the complexity of the algorithm to be equal to the number of data exchanges made in sorting N elements?

(a) The function listed below implements a sorting algorithm called selection sort. Explain how the algorithm works, with reference to the Demonstrate the operation of the algorithm on the array [4 3 2 1 6 5 typedef int Key void selection_sort (Key array, int n) int i, j, min, minindex, temp; for(i 0; i