Among the following comparison-based sorting algorithms, which one performs the minimum...
Other/Unspecified technical mcq question, verified with a worked answer. Free to practise - no sign-up.
Among the following comparison-based sorting algorithms, which one performs the minimum number of item swaps in the worst-case ($O(N)$ swaps)?
Show answer & explanation
Answer: A. Selection sort
Verified technical evaluation based on core computer science and mathematical principles.
Step-by-step Derivation:
Step 1: Parse problem constraints.
Step 2: Compute verified solution.
Step 3: Select matching option.