Divide and Conquer Algorithm to find maximum sum subarray | Algorithms | C++

[VyomGarg47]

Title - Divide and Conquer approach in find maximum sum subarray in O(n).

Type of Issue -

Please add/delete options that are not relevant.

• [x] Adding New Code

Programming Language

Please add/delete options that are not relevant.

• [x] C++

Self Check

• Ask for issue assignment before making Pull Request.
• Add your file in the proper folder
• Clean Code and Documentation for better readability
• Add Title and Description of the program in the file

:star2: Star it :fork_and_knife:Fork it :handshake: Contribute to it!

Discord server ✉️ - https://discord.gg/FXyh2S3

Happy Coding,

[VyomGarg47]

Please assign this issue to me.

[Tripathi-Alok]

Can you please assign this to me

[ExpressHermes]

@VyomGarg47 I think this has been implemented.

[shubham5351]

@VyomGarg47 you can work on this issue.

[abby3010]

I would like to work on this as I see there is no work done for a year on this issue.

@shubham5351 if possible please assign the issue to me!