Feature/new feature: Implement Brute Force Maximum Subarray Sum Algorithm (O(n²))
#606
| Job | Run time |
|---|---|
| 2m 42s | |
| 1m 20s | |
| 1m 19s | |
| 5m 41s | |
| 1m 22s | |
| 59s | |
| 43s | |
| 14m 6s |