What is the average case time complexity of recursive selection sort?

Mr. Dubey • 52.30K Points
Coach

Q. What is the average case time complexity of recursive selection sort?

(A) o(n)

(B) o(n log n)

(D) o(log n)

Correct : Option (C)

Explanation:

 the overall recurrence relation of recursive selection sort is given by t(n) = t(n-1) + n. it is found to be equal to o(n2). it is unvaried throughout the three cases.

Discusssion

Be the first to start discuss.

Q. Any superset of an infrequent set is an infrequent set. This is ___________

Q. Which one of the following is an element of directing?

Q. Suppose you plotted a scatter plot between the residuals and predicted values in linear regression and you found that there is a relationship between

Q. Which of the following is not the guiding principle of software project scheduling?

Q. Veriﬁcation and Validation uses _.

Q. ________ helps to communicate the overall system architecture unambiguously.

Q. If we multiply ' 723 ' and ' 34 ' by representing them in floating point notation i.e. By first, converting them in floating point representation and

Q. Admissibility of the heuristic function is given as:

Q. The range of a valid LOW input is:

Q. What is the average case time complexity of recursive selection sort?

Discusssion

Related MCQs