Consider the following algorithm which takes as input an array A of size n. It first sorts the array and then counts the number of duplicate elements: n = length(A);
for(j = 0; j < n; j++){
lastswap = 1; for(i = 1; i if A[i-1] > A[i] {
temp = A[i-1];
A[i - A] = A[i];
A[i] = temp;
lastswap = i;
}
n = lastswap;
}
int numDupl = 0;
for(j = 0; j Il riundupi - u,
for(j = 0; j < n; j++){
if (A[j] == A[j + 1])
numDupl++;
return numDupl;
Determine the complexity of this algorithm.
A. O(nlogn).
B. O(n).
C. O(n^2).
D. None of the above.