-
-
Notifications
You must be signed in to change notification settings - Fork 7.7k
Closed
Labels
enhancementNew feature or requestNew feature or request
Description
It is a very commonly used algorithm for sub-array problems.
Detailed Description
It is most famously used in the "maximum sum of sub array" question. The reason being that Kadane's algorithm has a time complexity of O(n), in comparison to the O(n^2) using traditional methods.
Context
Sub-array problems are very common kind of questions, also asked in many Coding Interviews.
There have been multiple pull requests made to include Kadane's algorithm in the repository.
This only supplements the importance of adding this algorithm to the repository.
Also this is one of the unknown type of algorithm, which can help a lot.
Possible Implementation
Multiple pull requests are available by the name "Kadane" in the very same repository
I hope this issue will be attended and dealt with.
Metadata
Metadata
Assignees
Labels
enhancementNew feature or requestNew feature or request