Question 14Asked in DSSSB TGT Computer Science (Technical), 1 Aug 2021, Shift 1

Arrange the following in ascending order of their average case complexity.

Arrange the following in ascending order of their average case complexity. Selection-sort, Quick-sort, Linear search, Binary search
  1. AQuick-Sort, Selection-sort, Binary search, Linear search
  2. BLinear search, Binary search, Selection-sort, Quick-sort
  3. CBinary search, Linear search, Quick-sort, Selection-sort
  4. DSelection-sort, Quick-sort, Linear search, Binary search
Show answerHide answer

Correct answer: (C) Binary search, Linear search, Quick-sort, Selection-sort

Explanation

Average cases: binary search O(log n) < linear search O(n) < quick sort O(n log n) < selection sort O(n²).

From DSSSB TGT Computer Science PYQ (Technical), 1 Aug 2021, Shift 1

This is question 14 of DSSSB TGT Computer Science PYQ (Technical), 1 Aug 2021, Shift 1. 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.