What is the time complexity of the divide and conquer algorithm used – McqOptions

MCQOPTIONS

1.	What is the time complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
A.	O(n)
B.	O(logn)
C.	O(nlogn)
D.	O(n2)
Answer» D. O(n2)

Discussion

No Comment Found

Related MCQs

What is the time complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
What is the output of the following naive method used to find the maximum sub-array sum?
What is the space complexity of the following naive method used to find the maximum sub-array sum in an array containing n elements?
What is the time complexity of the following naive method used to find the maximum sub-array sum in an array containing n elements?
Consider the following naive method to find the maximum sub-array sum: Which line should be inserted to complete the above code?
Find the maximum sub-array sum for the given elements. {-2, -1, -3, -4, -1, -2, -1, -5, -4}
Find the maximum sub-array sum for the given elements. {2, -1, 3, -4, 1, -2, -1, 5, -4}
Given a one-dimensional array of integers, you have to find a sub-array with maximum sum. This is the maximum sub-array sum problem. Which of these methods can be used to solve the problem?