🎴 Flashcard Mode
DBMS
Card1 / 25
Mastered0
Review0
QuestionClick to flip
Selection sort's average time complexity is
AnswerClick to flip back
A
O(n2)
💡 Explanation:
Selection sort makes n-1 passes, each time scanning remaining unsorted elements to find the minimum. This always requires roughly n²/2 comparisons, giving O(n²) in all cases.