Which one of the following in place sorting algorithms needs the minimum number of swaps?

Keep practicing — related questions

• Which of the following algorithms does not have the same complexity for the worst case and the average case?
• What is the number of swaps required to sort n elements using selection sort, in the worst case?
• What is the number of swaps required to sort n elements using selection sort, in the worst case?
• Which of the following is/are unstable sort(s)?
• Which of the following sorting algorithms has the lowest worst-case complexity?
• Which of the following sorting algorithms has the lowest worst-case complexity?
• Which of the following sorting techniques is the most efficient for small, almost sorted data sets?
• Directions: Three of the following numbers have something in common. Find the odd one.