Kadane's algorithm (max subarray)

About this topic

Find maximum subarray sum in O(n).

Part of Data Structures & Algorithms (C++): 25 topics, 5 free.

More topics in this course

• Time and space complexity (Big-O)
• Arrays and vectors
• Two pointers
• Binary search
• Bubble, selection and insertion sort
• Linked lists
• Stacks