Question discussion

Arrange the following in ascending order of their average case complexity. Selection-sort, Quick-sort, Linear search, Binary search

359820Medium DSSSB TGT Computer Science 0 replies 0 views
0

Arrange the following in ascending order of their average case complexity. Selection-sort, Quick-sort, Linear search, Binary search

  • ABinary search, Linear search, Quick-sort, Selection-sort
  • BLinear search, Binary search, Selection-sort, Quick-sort
  • CQuick-sort, Selection-sort, Binary search, Linear search
  • DSelection-sort, Quick-sort, Linear search, Binary search
Correct answer: A

Explanation

Binary search O(log n) < linear search O(n) < quick-sort O(n log n) on average < selection sort O(n²).

Discussion 0

Nobody has replied yet. Start the discussion!