M

Mr. Dubey • 100.69K Points
Coach

Q. Under what case of Master’s theorem will the recurrence relation of stooge sort fall?

  • (A) 1
  • (B) 2
  • (C) 3
  • (D) it cannot be solved using master’s theorem
Share
Explanation by: Mr. Dubey
the recurrence relation of stooge sort is given as t(n) = 3t(2/3n) + o(1). it is found too be equal to o(n2.7) using master’s theorem first case.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. -------------systems used organizational data as well as external data collected from environment of the organization.

Q. If G is a connected planar graph of v vertices e edges and r regions then

Q. Which of the following is a part of system release?

Q. The actual execution of instructions happens in

Q. ______test is used in an online transactional processing environment.

Q. What is the full form of ISA?

Q. In ____________, the value of an attribute is examined as it varies over time.

Q. Convert the binary number 10110 to Gray code:

Q. The primary purpose of an operating system is:

Q. If the longest chain in a partial order is of length l, then the partial order can be written as disjoint antichains.

Question analytics