Let's test your knowledge. Click the correct answer from the options.
What is the time complexity to find the largest sum of a contiguous subarray using Kadene's algorithm?
Click the option that best answers the question.
- O(n)
- O(1)
- O(log n)
- None of the above