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[j

[answerhappygod]

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 J 1 (12.23 KiB) Viewed 24 times

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[j] > A[i+1] swap A[j] and A[i+1] a) If the input is: A[0] = n; A[1] = n − 1; · many swaps will be made. --- ; A[n 1] = 1, then how b) How many comparisons will be made in general?