to reduce the time complexity

[mihir-k64]

I would like to contribute an implementation of the Kadane Algorithm using O(n) time complexity making it more efficient
The algorithm which i will implement will solve it using a single for loop saving the execution time and reducing the time complexity

I will contribute the program as well as a README file containing the algorithm and an explanation of the approach.

Please assign this issue to me under Hacktoberfest 2024.
Thank you