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

(a) O(nlogn)

(b) O(logn)

(c) O(n)

(d) O(n^2)

This question was addressed to me in an interview for job.

Query is from Selection Sort topic in chapter Sorting of Data Structures & Algorithms II

1 Answer

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

The best I can explain: The best, average and worst case complexities of selection sort is O(n^2).

(n-1) + (n-2) + (n-3) + …. + 1 = (n(n-1))/2 ~ (n^2)/2.

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.