M

Mr. Dubey • 100.69K Points
Coach

Q. What will be the recurrence relation of the code of recursive selection sort?

  • (A) t(n) = 2t(n/2) + n
  • (B) t(n) = 2t(n/2) + c
  • (C) t(n) = t(n-1) + n
  • (D) t(n) = t(n-1) + c
Share
Explanation by: Mr. Dubey
function to find the minimum element index takes n time.the recursive call is made to one less element than in the previous call so the overall recurrence relation becomes t(n) = t(n-1) + n.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. What is the first stage of risk assessment?

Q. Statistical quality control.

Q. Specifies the function that will be called when a successful connection with the PubNub cloud.

Q. In AES in which Round Subkeys are Generated from Original key for each round?

Q. The number of elements in the Open IoT Architecture?

Q. Host-specific routing is used for purposes such as checking route or providing

Q. In function point analysis, number of Complexity adjustment factor is

Q. The biggest drawback of the level indicator in the classic star-schema is that it limits_________.

Q. Advantages: question can be varied to suit context Disadvantages Time consuming

Q. Defect is a technique that was developed to estimate the number of defects resident in a piece of software.

Question analytics