williamfiset / williamfiset/algorithms
Add longest increasing subsequence O(nlogn) implementation.
Open
@iriediese is already working on this.
Since Mar 2, 2021.
- Dominant language
- Java
- Stars
- 18.8k
- Forks
- 4.5k
- PR merge metrics
- No merged PRs in 30d
Description
There's a faster way than the DP approach to solve the LIS problem. It can be solved in O(nlogn) time with a binary search, let's add it to the repo.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Assessment
This issue has not been assessed yet.