+1 vote
in Data Structures & Algorithms II by (110k points)
What is the average case complexity of selection sort?

(a) O(nlogn)

(b) O(logn)

(c) O(n)

(d) O(n^2)

This question was addressed to me during an online interview.

Origin of the question is Selection Sort topic in section Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Correct choice is (d) O(n^2)

The explanation is: In the average case, even if the input is partially sorted, selection sort behaves as if the entire array is not sorted. Selection sort is insensitive to input.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...