Skip to content

A C++ implementation solving the problem of finding the longest increasing subsequence.

License

Notifications You must be signed in to change notification settings

VietAnh13/Longest_Increasing_Subsequence

Repository files navigation

Longest Increasing Subsequence (LIS)

A C++ implementation to solve the LIS problem, with two approaches: exhaustive search (returns all results) and fast search (returns a single result).

The input is a random string (generated using random string generation or custom string selection), and the output is the longest increasing subsequence (along with its length).

demo_lis_img

About

A C++ implementation solving the problem of finding the longest increasing subsequence.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages