Question – In the best case, what is the minimum number of swaps are possible using Selection Sort Algorithm?
My Take – Best case –> means can we take input array as best case is mentioned – like already sorted Array (ascending or reverse sorted) array in both cases Selection Sort makes zero swaps i.e Ɵ(1)
But I remember Arjun Sir once mentioned that – Best case for worst case Input. So, should we take unsorted array and like 213 and say minimum number of swaps selection sort can make is Ɵ(n)
Please help, I’m kinda confused.