Maximum Subarray Sum (divide and conquer)

[sajalagrawal14 (sajal agrawal)]

is o(nsquare) time complexicity is the original solution of this problem .
i have done a simple looping of n square and it got accepted