The solution to the popular maximum sum sub-array problem has been provided using the Dynamic Programming approach.
-
Updated
Jun 6, 2021 - C++
The solution to the popular maximum sum sub-array problem has been provided using the Dynamic Programming approach.
A C algorithm that generates alternating positive/negative integers in range [-10, 10], places them into random array indices, and identifies the contiguous subarray of size N/2 that yields the maximum sum.
Welcome to the Data Structures and Algorithms (DSA) practice repository! This repository serves as a hub for practicing and honing your skills in data structures and algorithms. It provides a collection of commonly asked DSA questions along with their solutions in various programming languages.
Coding Factory @ AUEB - Java mini Projects - Chapter 10
Add a description, image, and links to the subarray-sum topic page so that developers can more easily learn about it.
To associate your repository with the subarray-sum topic, visit your repo's landing page and select "manage topics."