Consider a sequence of 14 elements: A = [–5, –10, 6, 3, –1, –2, 13, 4, –9, –1, 4, 12, –3, 0]. The subsequence sum . Determine the maximum of , where . (Divide and conquer approach may be used.)
GATE CS 2019 (Forenoon) — Question 35
AlgorithmsDivide-and-Conquer DesignsNAT1 markHard
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

