Your friend says he has come up with a brand$-$new sorting algorithm that

sorts in W$($n$)=$ O$($nlogn$)$ comparisons even though it corrects

only one bad pair per comparison.

Please teach him why he is wrong by referring to a theorem and F$($n$)$ formula in terms of N$.$