Consider sorting n numbers stored in array A by first finding the largest element of A and exchang- ing it with the element in A[n]. Then find the second largest element of A and exchange it with A[n 1]. Continue in this manner for the first n - 1 elements of A. (a) Write a (non-recursive) pseudocode for this algorithm, which is known as selection sort. Give the best-case and worst-case running times of selection sort in 9-notation. ¹Le., function of the form a"nº logº n for constants a ≥1 and b, c ≥ 0. 2This way even if you got part (a) wrong, you can still have correct solution to part (b).

Consider sorting n numbers stored in array A by first finding the largest element of A and exchang- ing it with the element in A[n]. Then find the second largest element of A and exchange it with A[n 1]. Continue in this manner for the first n - 1 elements of A. (a) Write a (non-recursive) pseudocode for this algorithm, which is known as selection sort. Give the best-case and worst-case running times of selection sort in 9-notation. ¹Le., function of the form a"nº logº n for constants a ≥1 and b, c ≥ 0. 2This way even if you got part (a) wrong, you can still have correct solution to part (b).