Data Structure and Algorithms (DSA) MCQ: What is the number of swaps required to sort n elements using selection sort, in the worst case?

← All Data Structure and Algorithms (DSA) questions

What is the number of swaps required to sort n elements using selection sort, in the worst case?

Correct Answer: Θ(n)

Make the most of this question

This page focuses on one Data Structure and Algorithms (DSA) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Data Structure and Algorithms (DSA) MCQs All Engineering topics Mock test hub