Assume that we run the following algorithm on an array A

Last updated: 4/5/2023

Assume that we run the following algorithm on an array A with n integer elements for i 1 to n 1 for j 0 to n i 1 if A i A i 1 swap A j and A j 1 a If the input is A 0 n A 1 n 1 A n 1 1 then how many swaps would be made b How many comparisons will be made in general on any array of n elements