Skip to content

add PatienceSorting-Algorithm #17

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
sw-rubix opened this issue May 5, 2021 · 0 comments
Open

add PatienceSorting-Algorithm #17

sw-rubix opened this issue May 5, 2021 · 0 comments

Comments

@sw-rubix
Copy link

sw-rubix commented May 5, 2021

https://en.wikipedia.org/wiki/Patience_sorting
In computer science, patience sorting is a sorting algorithm inspired by, and named after, the card game patience. A variant of the algorithm efficiently computes the length of a longest increasing subsequence in a given array.

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

No branches or pull requests

1 participant