Algorithm Designex01e2
Maximum Contiguous Sum
01f30cb0-0bd0-4317-9d34-2922bba5ca7e.cppC++
1// Loading code...Selected Submission
0 / 100
1.601s
1648 KB
Implementation
Time Comp.
O(n^2)
Space Comp.
O(1)
Readability
4/10
"The code calculates the maximum sum of a contiguous subsequence within a given array. It iterates through all possible subsequences and computes their sums, ultimately returning the maximum sum found, which is a straightforward implementation of the maximum subarray problem."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #7 | 0 | 1/30/2025 |
| Try #6 | 0 | 1/30/2025 |
| Try #5 | 100 | 1/30/2025 |
| Try #4 | 100 | 1/30/2025 |
| Try #3 | 100 | 1/30/2025 |
| Try #2 | 100 | 1/30/2025 |
| Try #1 | 70 | 1/30/2025 |