Solved issue #114 - Githubissues

KangHyeoni commented 4 years ago

Resolves Issue #114

Longest Increasing Subsequence algorithm that has O(n^2) time complexity.(used dynamic programming)

g++ -std=c++14 -o lis alg_nsquare.cpp
./lis

[x] Code compiles correctly.
[x] Changes are tested properly.
[x] Followed the Contributing guidelines.
[x] Write an algorithm that finds longest increasing subsequence in O(n^2) time complexity.
[ ] Write an algorithm that finds longest increasing subsequence in O(nlog(n)) time complexity.

KangHyeoni commented 4 years ago

@rakki-18 Could you review this PR.

rakki-18 commented 4 years ago

@KangHyeoni good work! @krithikvaidya please merge.

WebClub-NITK / Hacktoberfest-2k20