Skip to content

Longest increasing subsequence (fast)#258

Open
iriediese wants to merge 6 commits intowilliamfiset:masterfrom
iriediese:development
Open

Longest increasing subsequence (fast)#258
iriediese wants to merge 6 commits intowilliamfiset:masterfrom
iriediese:development

Conversation

@iriediese
Copy link

add O(n * log n) implementation of the longest increasing subsequence algorithm, with unit tests. Fix #12.

ioanacotutiu and others added 6 commits March 2, 2021 14:40
Added implementation for the longest increasing subsequence.

Co-Authored-By: Theodor Andrei Moise <38431187+iriediese@users.noreply.github.com>
Co-Authored-By: Nihm <24206687+Nihm@users.noreply.github.com>
Co-Authored-By: johennin <52281498+johennin@users.noreply.github.com>
Co-Authored-By: JoaBon <34160048+JoaBon@users.noreply.github.com>
Added code documentation.
Renamed variables.
Refactored code.

Co-Authored-By: Theodor Andrei Moise <38431187+iriediese@users.noreply.github.com>
Added test cases for LongestIncreasingSubsequenceFast.
Added some refactoring.

Co-Authored-By: Theodor Andrei Moise <38431187+iriediese@users.noreply.github.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Add longest increasing subsequence O(nlogn) implementation.

2 participants