PA of Algorithms Q101
0. Which one the following in place sorting algorithms needs the minimum number of swaps?
- Option : C
- Explanation : Minimum no of swap for selection sort is O when array is already sorted and maximum swap is Q(n).
You must be logged in to post a comment.
You must be logged in to post a comment.