0 votes 0 votes Write pseudo code for the brute-force method of solving the $maximum-subarray$ problem. Your procedure should run in $\Theta(n^2)$ time. Algorithms cormen algorithms divide-and-conquer descriptive + – akash.dinkar12 asked Apr 5, 2019 akash.dinkar12 296 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.