UTpaper

Free mock tests & test series

Question 81Asked in DSSSB PGT Computer Science (Technical), 11 Jul 2021

What is the complexity of selection sort algorithms?

  1. AO(n)
  2. BO(n log₂n)
  3. CO(n²)
  4. DO(2n)
Show answerHide answer

Correct answer: (C) O(n²)

Explanation

Selection sort always makes about n²/2 comparisons, scanning the unsorted part for the minimum on each of n passes, so it is O(n²) in every case.

From DSSSB PGT Computer Science PYQ (Technical), 11 Jul 2021

This is question 81 of DSSSB PGT Computer Science PYQ (Technical), 11 Jul 2021. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.