Closed Kam149 closed 3 years ago
Kadane’s algorithm is used to find out the maximum subarray sum from an array of integers. The time complexity of the algorithm is O(n) and Space Complexity is O(1).
The question asked in codechef to find maximum sum of the elements in an array.
Kadane’s algorithm is used to find out the maximum subarray sum from an array of integers. The time complexity of the algorithm is O(n) and Space Complexity is O(1).