Prove that BadSort $($below$)$ is not a correct sorting algorithm.

Input: data: array of integers

Input: $n$ : size of data

Output: Permutation of data such that

data$[1]$data$[2]$dots$$data$[n]$

Algorithm: BadSort

for $i=n-1$ to $1$ step $-1$ do

Consider every $i^{th}$ value of data, starting at data $1$;

if two of these values are out of order then

Swap them;

end

end

return data;