Algorithms Add longest increasing subsequence O(nlogn) implementation.

Add longest increasing subsequence O(nlogn) implementation.

Open williamfiset opened this issue 7 years ago • 2 comments

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.

Oct 24 '17 04:10 williamfiset

http://ujjavalsingh.blogspot.com/2013/08/longest-increasing-sub-sequence-on-logn.html

Jul 04 '18 00:07 williamfiset

Hey, I'd like to give this a try.

Mar 01 '21 14:03 iriediese