swaps

The pseudocode of a function fun () is given below: fun(int A[0,...,n-1]){ for i=0 to n-2 for j=0 to n-i-2 if (A[j]>A[j+1]) then swap A[j] and A[j+1] } Let A[0, ...,29] be an array...

Which of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?

What is the number of swaps required to sort n elements using selection sort, in the worst case?

Which one of the following in place sorting algorithms needs the minimum number of swaps?

Suppose we want to arrange the n numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is