M

Mr. Dubey • 52.48K Points
Coach 

Q. What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?

(A) o(n)
(B) o(1)
(C) o(n!)
(D) o(n2)
Share
Explanation by: Mr. Dubey 
 the divide and conquer algorithm uses a constant space. so, the space complexity is o(1).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. Consider the following grammars (S1) : A --> aBCD B --> bc|c C --> d|∈ D -> b (S2) : A --> aBCD B --> bc|∈ C --> d|c D

Q. 10Base5, 10Base2, 10BaseT are types of?

Q. A tablespace is further broken down into

Q. The first commercial RDBMS is:

Q. Statistical significance is

Q. How many two-input AND and OR gates are required to realize Y = CD+EF+G?

Q. In web mining, is used to know the order in which URLs tend to be accessed.

Q. A ___________ is a script whose main purpose is to run some program. In this case, the program is the C compiler.

Q. Which scheme uses a randomization approach?

Q. A software component

Question analytics