Which one of the following is the tightest upper bound that represents the number of swaps required to sort $n$ numbers using selection sort?
But the time complexity of Selection Sort is O(n2).. There are two loops, one inside the other
Ok. Thanks Sir... The book from where I read has given wrong algorithm, saying it to be Selection Sort.. As per that algorithm, number of swaps are also O(n2).
Can we challenge this question?