emircetinmemis / maximum-subarray-sum-expandation

This project is a simple implementation of the Max SubArray problem. To analyze algorithm erficiency, the project uses the following algorithms:

Welcome to the Max SubArray Project.

This project is a simple implementation of the Max SubArray problem. To analyze algorithm erficiency, the project uses the following algorithms:

• 1. Brute Force
• 2. Divide and Conquer
• 3. Kadane's Algorithm

The project also includes a simple test suite to test the algorithms.

To run the project.

install requirements for python packages, then run one of the following python scripts:

Note: It is sufficient to have an anaconda environment to run though for that use following.

• conda create -n msse ; pip install -r requirements.txt ; conda activate msse

1. main.py - runs the test suite and prints the results.
2. application.py - runs the application and prints the results.

See images for sample output.

maximum-subarray-sum-expandation's Issues

Iteration Count Error

While counting the iterator amount we are robbably calculating somehow wrong number of iterations for brute force and divide % conquer. Try to fix this.