M

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)
(C) o(n2)
(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.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which of the following command is used to delete a trigger?

Q. What are the criteria to decide the testing efforts? 1. Time and budget 2. Size of development team 3. Size of testers 4. Risk associated with project

Q. In order to assess how much information is brought by each component, and the correlation among them, a useful tool is the_____.

Q. Views of quality software would not include

Q. _________ is the focus point for a manager while controlling, as controlling at every step is not possible.

Q. Which crossover operators are used in evolutionary programming?

Q. The behavior of a system is modeled using ________

Q. A .... is a named location on a disk where files are stored

Q. The Owner Computes Rule generally states that the process assigned a particular data item is responsible for?

Q. The full form of SIPO is