Find the longest increasing or decreasing subsequence of a sequence.
Project description
Longest Increasing Subsequence
Find the longest increasing or decreasing subsequence of a sequence.
Free software: MIT license
Documentation: https://longest-increasing-subsequence.readthedocs.io.
Features
TODO
Credits
This package was created with Cookiecutter and the audreyr/cookiecutter-pypackage project template.
History
0.1.0 (2021-02-15)
First release on PyPI.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Close
Hashes for longest_increasing_subsequence-0.1.0.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 911ce6a470b315b378c9b5c63a6ad5a4b09278d362835c9ada66c31b2b95cfa7 |
|
MD5 | 0b52c88dc02abaa21fe7c7a61e2420ce |
|
BLAKE2b-256 | c1fe46841222f86540515615ce0d7a52f208afc50ab2798fce42bcdf783b1358 |
Close
Hashes for longest_increasing_subsequence-0.1.0-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 7e39999ba9020eced1210a255eadf0ee4d73908910c1991a6cdce12fa503dffd |
|
MD5 | e9ccae650bb7abbcc819d60d13d4ae57 |
|
BLAKE2b-256 | 81472cc066764666379c5ad43d48a67d224676cd0d81afb4cda924ad619ad175 |