Maximum sum subarray problem using divide and conquer approach

Explanation of Maximum sum subarray problem using divide and conquer approach and its running time
Here we discussed brute force solution and improved running time of algo from cubic to quadratic.
Then we used divide and conquer technique to solve this problem and derived its time complexity to be O(n log n)

[pushkarsoni]

In the final part: for Crosssum, you mistakenly called the same function instead of max_crossing_subarray.
the video was great! and Informative, Thanks.

[dineshsood]

Finally, I could understand the "divide and conquer approach". Especially, the "cross-sum" part. Thanks a lot.

[Trails]

One of the best videos I've seen on this problem. Going from brute force to optimal with clear explanations. Thank you.

[hoseinkangavarnazari]

The only video explains combine step clearly, great job

[arsenalism]

In Divide and Conquer approach, the iteration should be i-- ?

[breezepiano]

line where cross sum is being calculated - we are passing 4 parameters there ? shouldnt it be just low and high ? 19:20

[viharisunkara]

for O(n^3) solution, shouldn't the sum be which on simplification gives O(n3).Instead you gave as 1(n)+(n-2)(n-2)+... Please correct me if I am wrong or correct the solution.

[tavaresgilberto]

Hi there, great video.I just have one question, We don’t need to restart sim, when we going to calculate the right sum?

[samuelfils]

Great content. This is really helping me in my algorithm course. Hope you continue to upload more algorithm videos.

[vikashkumaryadav]

how many notes u have pasted on ur wall?
;p

[MrugankNaik]

Thank you so much.... Your teaching style is very simple and helpful... Best video on this topic as far now....

[ritwikkumar]

Correct me if i am wrong but this algo using divide n conquer has been taken from CLRS

[sarthaknagrani]

Can i send one question which you can help on?

[yaswanthkumar]

for(i=mid;i>=low;i--) is correct. you written i++ which will run infinite times

[stayfearless]

Can anyone explain the part:
for (i=mid; i>=low; i++). Are we traversing backwards from mid, I thought it may have been for(i=low, i<=mid; i++) or (i=mid; i>=low; i--).

[shamanthhegde]

in 12:26 the 2 and -5 would come in left side and only 8 remain on the right and the same goes for 6, -2 and 5 and even when there are only two elements in array it gets divided into single element

[sandeepgupta]

I have collected some doubt regarding Algo...I wanna discus you

[aanandroy]

Perfectly explained! Please make one on The Skyline Problem using Divide and Conquer algorithm :D

[thiraviamnatarajan]

you explained very clearly thank you so much

[vikkydon]

Thank You So Much :)
Perfect Explanation