Find an exact formula for the worst-case number of comparisons between array elements made by selection_sort on arrays of n elements. Do the same for the number of swaps. // selection sort erray...

Extracted text: Find an exact formula for the worst-case number of comparisons between array elements made by selection_sort on arrays of n elements. Do the same for the number of swaps. // selection sort erray 1[0..n-1] void selection_sort(int à[], int n) if (n == 1) return; // swap largast & rightmost, than racurse swap (A[pmax (A, n)], A[n-1]); selection_sort (A, n-1);